Floyd, R. W. "Algorithm 97." Comm. Acm 5-6, 345, 1962

https://www.c-sharpcorner.com/article/getting-started-with-floyds-warshall-algorithm/

https://www.programmingalgorithms.com/algorithm/floyd%E2%80%93warshall-algorithm/

https://stackoverflow.com/questions/4526574/how-to-output-the-shortest-path-in-floyd-warshall-algorithm

SEE ALSO:

All-Pairs Shortest Path, Bellman-Ford Algorithm, Dijkstra's Algorithm, Graph Distance, Graph Distance Matrix, Graph Geodesic, Shortest Path Problem

REFERENCES:

Atallah, M. J. (Ed.). "Basic Graph Algorithms." Ch. 6 in Algorithms and Theory of Computation Handbook. Boca Raton, FL: CRC Press, 1998.

Floyd, R. W. "Algorithm 97." Comm. ACM 5-6, 345, 1962.

Larson, R. and Odoni, A. "Shortest Paths between All Pairs of Nodes." §6.2.2 in Urban Operations Research. 1981. https://web.mit.edu/urban_or_book/www/book/chapter6/6.2.2.html.

Loerch, U. "Floyd's Algorithm." Auckland, New Zealand: Dept. Computer Science, University of Auckland, 2000. https://www.cs.auckland.ac.nz/~ute/220ft/graphalg/node21.html.

Pemmaraju, S. and Skiena, S. "All-Pairs Shortest Paths" and "Transitive Closure and Reduction." §8.1.2 §8.5.2 in Computational Discrete Mathematics: Combinatorics and Graph Theory in Mathematica. Cambridge, England: Cambridge University Press, pp. 330-331 and 353-356, 2003.

Preiss, B. "Floyd's Algorithm." in Data Structures and Algorithms with Object-Oriented Design Patterns in Java. 1998. https://www.brpreiss.com/books/opus5/html/page570.html.

Roy, B. "Transitivité et connexité." C. R. Acad. Sci. Paris 249, 216-218, 1959.

Warshall, S. "A Theorem on Boolean Matrices." J. ACM 9, 11-12, 1962.

Referenced on Wolfram|Alpha: Floyd-Warshall Algorithm

CITE THIS AS:

Weisstein, Eric W. "Floyd-Warshall Algorithm." From MathWorld--A Wolfram Web Resource. https://mathworld.wolfram.com/Floyd-WarshallAlgorithm.html