Floyd Shortest Path Routing
find the shortest path from any node to any node in a network
You are now following this Submission
- You will see updates in your followed content feed
- You may receive emails, depending on your communication preferences
Given a input adjacent matrix (AdjMax) that represents a weighted, directed graph. The function finds the shorest path from one vertex 'i' to another 'j'. The return values includes a matrix (S) that denotes the shortest distance between vertices 'i' and 'j', and a matrix (P) that denotes the next vertex 'k' on the path from vertex 'i' to vertex 'j'
Cite As
Weihuang Fu (2026). Floyd Shortest Path Routing (https://in.mathworks.com/matlabcentral/fileexchange/11549-floyd-shortest-path-routing), MATLAB Central File Exchange. Retrieved .
General Information
- Version 1.0.0.0 (583 Bytes)
-
No License
MATLAB Release Compatibility
- Compatible with any release
Platform Compatibility
- Windows
- macOS
- Linux
| Version | Published | Release Notes | Action |
|---|---|---|---|
| 1.0.0.0 |
