[Neo4j] finding top 10 shortest path

[Peter Neubauer]

Thanks for the pointers Daniel, feel free to fork
https://github.com/neo4j/community/tree/master/graph-algo and try
stuff out together with Reza?

Cheers,

/peter neubauer

GTalk:      neubauer.peter
Skype       peter.neubauer
Phone       +46 704 106975
LinkedIn   http://www.linkedin.com/in/neubauer
Twitter      http://twitter.com/peterneubauer

http://www.neo4j.org               - Your high performance graph database.
http://startupbootcamp.org/    - Öresund - Innovation happens HERE.
http://www.thoughtmade.com - Scandinavia's coolest Bring-a-Thing party.



On Mon, Sep 12, 2011 at 8:13 PM, danielb <danielberchtold at gmail.com> wrote:
> 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
> investigation.
>
> regards,
> Daniel
>
> [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.
> _______________________________________________
> Neo4j mailing list
> User at lists.neo4j.org
> https://lists.neo4j.org/mailman/listinfo/user
>