Floyd Shortest Path Routing

Version 1.0.0.0 (583 Bytes) by Weihuang Fu
find the shortest path from any node to any node in a network
4.1
(9)
7K Downloads
Updated 27 Jun 2006

No License

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://www.mathworks.com/matlabcentral/fileexchange/11549-floyd-shortest-path-routing), MATLAB Central File Exchange. Retrieved .

MATLAB Release Compatibility
Created with R14SP1
Compatible with any release
Platform Compatibility
Windows macOS Linux
Tags Add Tags

Version Published Release Notes
1.0.0.0