Eppstein's K Shortest Paths

[handloomweaver]

Hi everyone

I was wondering if any of you have ever tackled (or know of a version) of David Eppstein's K-Shortest Paths algorithm in Networkx (or in Python) [or the "lazy" version] or be up for giving it a go. I have read his paper (http://www.ics.uci.edu/~eppstein/pubs/Epp-SJC-98.pdf) but it's beyond me as there's no pseudocode. But this really helped - http://www.isi.edu/natural-language/people/epp-cs562.pdf But all versions of it I can find are in C, Java or C#. I also can't find a pseudocode example which would help me. It solves such a common use case and would, I think, be an excellent addition to the canon of nx algorithms. However, if there are other approaches to a fast sorted list of weighted digraph shortest paths in nx I'm open to that too

Thoughts?

[Aric Hagberg]

That is an interesting paper and the algorithm would be a great addition.
I believe we have discussed this before but so far nobody has
contributed any code.
If you want to try we will be happy to help you get it included.
Eppstein himself is also a very skilled Python programmer and might
have some code. Though in 1998 it would have been Python version
1.5...
Aric

> --
> You received this message because you are subscribed to the Google Groups
> "networkx-discuss" group.
> To unsubscribe from this group and stop receiving emails from it, send an
> email to networkx-discu...@googlegroups.com.
> To post to this group, send email to networkx...@googlegroups.com.
> Visit this group at http://groups.google.com/group/networkx-discuss.
> For more options, visit https://groups.google.com/groups/opt_out.