bsmock / k-shortest-paths

A collection of algorithms (including Yen, Eppstein, and Lazy Eppstein) to compute the K shortest paths between two nodes in a weighted, directed graph, implemented in Java.
47Updated 7 years ago

Related projects

Alternatives and complementary repositories for k-shortest-paths