Floyd Shortest Path Routing

Versión 1.0.0.0 (583 Bytes) por Weihuang Fu
find the shortest path from any node to any node in a network
4.1
(9)
7K Descargas
Actualizado 27 jun 2006

Sin licencia

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'

Citar como

Weihuang Fu (2025). Floyd Shortest Path Routing (https://www.mathworks.com/matlabcentral/fileexchange/11549-floyd-shortest-path-routing), MATLAB Central File Exchange. Recuperado .

Compatibilidad con la versión de MATLAB
Se creó con R14SP1
Compatible con cualquier versión
Compatibilidad con las plataformas
Windows macOS Linux

Community Treasure Hunt

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

Start Hunting!

Versión Publicado Notas de la versión
1.0.0.0