[Neo4j] finding top 10 shortest path

danielb danielberchtold at gmail.com
Mon Sep 12 20:13:34 CEST 2011

Hello you both could have a look at the so-called "k-shortest-paths problem". 
There is some related scientific work[1] and implementations[2] for further


[1] http://www.mat.uc.pt/~eqvm/cientificos/investigacao/r_papers.html#K
[2] http://code.google.com/p/k-shortest-paths/

View this message in context: http://neo4j-community-discussions.438527.n3.nabble.com/Neo4j-finding-top-10-shortest-path-tp3235128p3330443.html
Sent from the Neo4j Community Discussions mailing list archive at Nabble.com.

More information about the User mailing list