Floyd–Warshall algorithm
Facts
11 propertiesIdentity
- Instance of
- pathfinding algorithm, graph algorithm[3]
More facts +10
- Average time complexity
- O(|V|^3)
- Best-case time complexity
- O(|S|^3)
- Computes solution to
- all-pairs shortest path problem[8]
- Different from
- Floyd Cycle Detection Algorithm[7]
- Discoverer or inventor
- Bernard Roy[2]
- Named after
- Robert W. Floyd, Stephen Warshall[4][5]
- Time of discovery or invention
- 1959[6]
- Worst-case space complexity
- O(|V|^2)
- Worst-case time complexity
- O(|S|^3)
- OpenAlex ID
- C186065694
- Image (Wikimedia Commons)
- Floyd-Warshall-Algorithm-Problem.png ↗
- Brilliant Wiki ID
- floyd-warshall-algorithm
- Dictionary of Algorithms and Data Structures ID
- floydWarshall
- Freebase ID
- /m/01hj8z
- MathWorld ID
- Floyd-WarshallAlgorithm
- Microsoft Academic ID (discontinued)
- 186065694
- PlanetMath ID
- FloydsAlgorithm
- Rosetta Code page ID
- Floyd-Warshall_algorithm
Named after 2
Different from 1
Discoverer or inventor 1
Maintained by WikiProject 1
Uses 1
← Different from 1
0 sources
Summary
Floyd–Warshall algorithm is a pathfinding algorithm[1].
Body
History and Context
Things named after include Robert W. Floyd[4], a computer scientist[11], 1936–2001[12], of United States[13], awarded the Guggenheim Fellowship[14], specialised in computer science[15] and Stephen Warshall[5], a mathematician[16], 1935–2006[17], of United States[18].