Floyd Shortest Path Routing
find the shortest path from any node to any node in a network
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'
引用格式
Weihuang Fu (2026). Floyd Shortest Path Routing (https://ww2.mathworks.cn/matlabcentral/fileexchange/11549-floyd-shortest-path-routing), MATLAB Central File Exchange. 检索时间: .
| 版本 | 已发布 | 发行说明 | Action |
|---|---|---|---|
| 1.0.0.0 |
