Vectorized Floyd-Warshall (Scripts) Publisher's description
from Dustin Arendt
The Floyd-Warshall algorithm computes the all pairs shortest path matrix for a given adjacency matrix
The Floyd-Warshall algorithm computes the all pairs shortest path matrix for a given adjacency matrix. The algorithm is O(n^3), and in most implementations you will see 3 nested for loops. This is very inefficient in Matlab, so in this version the two inner loops are vectorized (and as a result, it runs much faster).
Make sure that your input matrix is initialized properly -- A(i,j) = Inf if i and j are not neighbors.[left][/left]
System Requirements:MATLAB 7.9 (2009b)
Program Release Status: New Release
Program Install Support: Install and Uninstall