Peter, it's not using Dijkstra... it's using https://github.com/neo4j/community/blob/master/graph-algo/src/main/java/org/neo4j/graphalgo/impl/path/ShortestPath.javawhich is basically a double-sided breadth-first algo.
2011/8/20 Peter Neubauer <[email protected]> > Boris, > The algo id using a double sided Dijkstra variant, taking possible cost > functions and supernodes into account. > > /peter > > Sent from my phone. > On Aug 20, 2011 5:33 AM, "Boris Kizelshteyn" <[email protected]> wrote: > > I need to document my usage of it, so it would be great if I knew :) > > > > Thanks! > > _______________________________________________ > > Neo4j mailing list > > [email protected] > > https://lists.neo4j.org/mailman/listinfo/user > _______________________________________________ > Neo4j mailing list > [email protected] > https://lists.neo4j.org/mailman/listinfo/user > -- Mattias Persson, [[email protected]] Hacker, Neo Technology www.neotechnology.com _______________________________________________ Neo4j mailing list [email protected] https://lists.neo4j.org/mailman/listinfo/user
