K-Shortest Path- Yen's algorithm
This function is based on Yen's k-Shortest Path algorithm:
J. Y. Yen, "Finding the K shortest loopless paths in a network", Management Science 17:712–716, 1971.
It returns:
1) [shortestPaths]: the list of K shortest paths (in cell array 1xK)
2) [totalCosts] : costs of the K shortest paths (in array 1xK)
Yen's algorithm prevents loops.
This function calls a slightly modified/simplified function dijkstra() (submitted by Xiaodong Wang, 2004)
The Network/Graph of N nodes is fed in the form of a NXN netCostMatrix which must have positive weights/costs.
IMPORTANT: see 'TestKShortestPath.m' and 'Test graph (case 1).pdf' for netCostMatrix format.
Cite As
Meral Sh. (2024). K-Shortest Path- Yen's algorithm (https://www.mathworks.com/matlabcentral/fileexchange/32513-k-shortest-path-yen-s-algorithm), MATLAB Central File Exchange. Retrieved .
MATLAB Release Compatibility
Platform Compatibility
Windows macOS LinuxCategories
Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!Discover Live Editor
Create scripts with code, output, and formatted text in a single executable document.
MATLAB_kShortestPath_Yen's algorithm/
Version | Published | Release Notes | |
---|---|---|---|
1.0.0.0 |