Dijkstra Algorithm Consistent with Cyclic Paths
No License
Given adjacent matrix (transmat) and starting/ending node (pathS, pathE), this function finds the shortest-path (path) that connecting pathS and pathE, and returns the cost (cost):
[path, cost]=dijkstra(pathS, pathE, transmat);
NOTE: Except for the simple interface, the pathS and pathE can be the same node, i.e., this implementation can find _cyclic_ paths.
Cite As
Yi Wang (2024). Dijkstra Algorithm Consistent with Cyclic Paths (https://www.mathworks.com/matlabcentral/fileexchange/7869-dijkstra-algorithm-consistent-with-cyclic-paths), MATLAB Central File Exchange. Retrieved .
MATLAB Release Compatibility
Platform Compatibility
Windows macOS LinuxCategories
Tags
Acknowledgements
Inspired by: Dijkstra Shortest Path Routing
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-dijkstra-cycle/
Version | Published | Release Notes | |
---|---|---|---|
1.0.0.0 | corrent Summary |