k-shortest-paths topic

C++ Alternative Routing Library for Boost.Graph. A configurable, efficient, plug-n-play solution for alternative route planning and k-shortest paths problems.

leonardoarcari

Implements K shortest path algorithms for networkx

dsaidgovsg

🦜 DISCOTRESS 🦜 is a software package to simulate and analyse the dynamics on arbitrary Markov chains

danieljsharpe

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.

bsmock