Yen's K-Shortest Path Algorithm Yen's algorithm computes single-source K-shortest loopless paths for a graph with non-negative edge cost. The algorithm was published by Jin Y. Yen in 1971 and implores any shortest path algorithm to find the best path, then proceeds to find K − 1 deviations of the best path. See also, Yen's Algorithm.
This repository was archived by the owner on Nov 19, 2017. It is now read-only.
vamcs/YenKSP
This branch is up to date with GGurtner/YenKSP:master.
Folders and files
| Name | Name | Last commit date | ||
|---|---|---|---|---|
Latest commitba10500 · | ||||