Jump to content

Floyd's algorithm

Add links
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Aaronbrick (talk | contribs) at 04:10, 1 October 2005. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

Floyd's algorithm is a O(n^3) algorithm to find the shortest path between all pairs of nodes in a graph. It was developed by Robert W Floyd.

See also

Retrieved from "https://en.wikipedia.org/w/index.php?title=Floyd%27s_algorithm&oldid=24455347"