TomasJohansson/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.

The main purpose of this fork was to make it into a maven project.

See the branch "adding-maven-structure-and-junit-test"

https://github.com/TomasJohansson/k-shortest-paths/commits/adding-maven-structure-and-junit-test