Hi John, One option could be to model the graph with 2 identical spatial layers and add walking relationships between the layers. Similar to the attached pic, its from http://bit.ly/hJN2BB and then only one walking relationship could be traversed.
Cheers Paddy On Mon, Apr 11, 2011 at 7:50 AM, John Doran <john.do...@hotmail.com> wrote: > Ive set up a graph to represent a transport network. A bus stop may be > connected to others with a walk relationship. All nodes have relationships > with dist and time. The purpose of it is to plan people's routes. > > I'm using aStar, and have tried using dijkstra but they both return similar > results. I'm using distance as the cost evaluator. > > My l problem is yes the shortest path being returned is the quickest but it > may mean jumping onto 5 separate buses(perhaps I should add a time > penalty when changing off your current route). Another option may be an > analysis of the actual transfer patterns returned from the shortest path > query. Use the one with the least amount of transfers. > > My question is could I provide some kind o heuristic to encourage staying > on > a route as far as it can go? > > Peter mentioned Hop-path to me when discussing. > _______________________________________________ > Neo4j mailing list > User@lists.neo4j.org > https://lists.neo4j.org/mailman/listinfo/user >
<<attachment: screenshot.png>>
_______________________________________________ Neo4j mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user
