(algorithm)
Definition: An algorithm to solve the all pairs shortest path problem in a weighted, directed graph by multiplying an adjacency-matrix representation of the graph multiple times. The edges may have negative weights, but no negative weight cycles. The time complexity is Θ (V³).
See also Johnson's algorithm.
Author: SKS
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified Fri Dec 17 12:04:17 2004.
HTML page formatted Wed Oct 26 09:47:33 2005.
Cite this as:
Sandeep Kumar Shukla, "Floyd-Warshall algorithm", from
Dictionary of Algorithms and Data
Structures, Paul E. Black, ed.,
NIST.
http://www.nist.gov/dads/HTML/floydWarshall.html
