On Tuesday, October 2, 2012, Wes Freeman wrote:
> So, when you're saying lightest, are you talking about path lengths, or
> relationship properties with weights/scores on them?

> Yeah, you can limit the result list of my query with LIMIT 5 (or
> something) to get the best 5, but if you have hundreds or thousands of
> paths it probably would get to be a slow query.

> Anyone know a better way to get the top n best paths?

> Wes

> On Tue, Oct 2, 2012 at 7:20 PM, Yuval Perlov <yuvalper...@gmail.com<javascript:_e({}, 'cvml', 'yuvalper...@gmail.com');>
> > wrote:

>> Seems the idea is to traverse all possible paths... what if there are a
>> lot of paths?  Dijkstra allows to find the best route but not the second
>> third etc but all might be too complex.

>> On Oct 3, 2012, at 1:13, Wes Freeman <freeman....@gmail.com<javascript:_e({}, 'cvml', 'freeman....@gmail.com');>>
>> wrote:

>> Please correct me if I'm misunderstanding your goal.

>> Is "lightest" a calculation of the sum of relationship costs?

>> If so, check out:

>> http://stackoverflow.com/questions/12587263/cypher-order-by-path-cost...

>> And:
>> http://console.neo4j.org/r/dygqp8

>> Note: reduce requires 1.9-SNAPSHOT.

>> Wes

>> On Tue, Oct 2, 2012 at 7:04 PM, Yuval <yuvalper...@gmail.com<javascript:_e({}, 'cvml', 'yuvalper...@gmail.com');>
>> > wrote:

>>> We would like to present several path results using weighted path
>>> finding - instead of the "lightest" route, we'd like to present the 5
>>> lightest routes.
>>> Is that possible?
>>> Has anyone done something similar?

>>> Yuval

>>> --

>>  --

>>  --

>  --