Floyd Shortest Path Routing

版本 1.0.0.0 (583 字节) 作者: Weihuang Fu
find the shortest path from any node to any node in a network
4.1
(9)
7.0K 次下载
更新时间 2006/6/27

无许可证

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. 检索时间: .

MATLAB 版本兼容性
创建方式 R14SP1
兼容任何版本
平台兼容性
Windows macOS Linux
标签 添加标签

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

版本 已发布 发行说明
1.0.0.0