Vectorized Floyd-Warshall

Version 1.0.0.0 (1.49 KB) by Dustin Arendt
Vectorized (fast) implementation of the Floyd-Warshall all pairs shortest path algorithm.
4.2
(6)
3.5K Downloads
Updated 7 Nov 2009

View License

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.

Cite As

Dustin Arendt (2024). Vectorized Floyd-Warshall (https://www.mathworks.com/matlabcentral/fileexchange/25776-vectorized-floyd-warshall), MATLAB Central File Exchange. Retrieved .

MATLAB Release Compatibility
Created with R2009b
Compatible with any release
Platform Compatibility
Windows macOS Linux
Categories
Find more on Graph and Network Algorithms in Help Center and MATLAB Answers

Community Treasure Hunt

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

Start Hunting!

Version Published Release Notes
1.0.0.0