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 has been archived by the owner on Nov 19, 2017. It is now read-only.
forked from GGurtner/YenKSP
-
Notifications
You must be signed in to change notification settings - Fork 1
vamcs/YenKSP
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Yen's K-Shortest Path Algorithm
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published
Languages
- Python 100.0%