Hello
I would be thankful a lot if you could add Yen's KSP to the Graphs algorithms. In general, it uses Dijkstra to find k-shortest paths and is crucial, when you need to get multiple weighted shortest paths contrary to one shortest path.
There are just a few implementations of it:
https://github.com/Pent00/YenKSP in Python
https://code.google.com/p/k-shortest-paths/ in C++/Java/C#
Having this one implemented would be a radical improvement comparing to other algorithm library implementations.
On another hand, I would be very curious to hear about other implementations, like Eppstein or Lawler
Hello
I would be thankful a lot if you could add Yen's KSP to the Graphs algorithms. In general, it uses Dijkstra to find k-shortest paths and is crucial, when you need to get multiple weighted shortest paths contrary to one shortest path.
There are just a few implementations of it:
https://github.com/Pent00/YenKSP in Python
https://code.google.com/p/k-shortest-paths/ in C++/Java/C#
Having this one implemented would be a radical improvement comparing to other algorithm library implementations.
On another hand, I would be very curious to hear about other implementations, like Eppstein or Lawler