kj-hong-ascentko/k-shortest-path

Yen's k-shortest path algorithm implementation for the Python NetworkX graph manipulation library

A NetworkX based implementation of Yen's algorithm for computing K-shortest paths.
Yen's algorithm computes single-source K-shortest loopless paths for a graph with non-negative edge cost. For more details, see: http://en.m.wikipedia.org/wiki/Yen%27s_algorithmk_shortest_path