The Dijkstra algorithm tries to find the path between two nodes which have the lowest cost (where cost could be f.ex. a property on each relationship). So that algorithm calculates costs and sums them for each path it tries out.
Check out http://en.wikipedia.org/wiki/Dijkstra's_algorithm for more information regarding that. Is this something you were looking for? 2010/6/23 Bruno Santos <b...@eksperimental.net> > Hi, > > I have a graph representing a public transport network and I need > to aggravate the cost of a certain edge based on the previous chosen edge. > Can I do this with the Dijkstra algorithm in the Graph - Algo package? > I did not find anything pointing in that direction in the javadocs. > > Thanks, > Bruno Santos > _______________________________________________ > Neo4j mailing list > User@lists.neo4j.org > https://lists.neo4j.org/mailman/listinfo/user > -- Mattias Persson, [matt...@neotechnology.com] Hacker, Neo Technology www.neotechnology.com _______________________________________________ Neo4j mailing list User@lists.neo4j.org https://lists.neo4j.org/mailman/listinfo/user
