Published April 3, 2017
| Version v1.0.1
Software
Open
bsmock/k-shortest-paths: First official major release
Description
This is the first official major release of the k-shortest-paths repository. It contains implementations of three well-known algorithms (Yen, Eppstein, and Lazy Eppstein), as well as a simplified version of Eppstein's algorithm that may be useful as a starting point for learning Eppstein's algorithm.
Files
bsmock/k-shortest-paths-v1.0.1.zip
Additional details
Related works
- Is supplement to
- https://github.com/bsmock/k-shortest-paths/tree/v1.0.1 (URL)