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.
Yen's algorithm computes loop-less paths only while Eppstein's algorithm computes paths with and without loops.
See the test code under edu/ufl/cise/bsmock/graph/ksp/test/ for example usage.
If you are using this code in published research, please give it a citation!
Author: Brandon Smock
Release 1.0.1 of the code has DOI: 10.5281/zenodo.439762
If you downloaded the code prior to release 1.0.1, you are using the same code that is in release 1.0.1, and you can cite that release.
Please see https://doi.org/10.5281/zenodo.439762 or https://zenodo.org/badge/latestdoi/45944277 for more information on the release and DOI.
Repository location: https://github.com/bsmock/k-shortest-paths
Any questions or comments, please email Brandon Smock (dr.brandon.smock@gmail.com).
Cheers!