Floyd Shortest Path Routing (Scripts) Publisher's description
from Weihuang Fu
Given a input adjacent matrix (AdjMax) that represents a weighted, directed graph
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'
System Requirements:MATLAB 7.0.1 (R14SP1)
Program Release Status: New Release
Program Install Support: Install and Uninstall