Floyd–Warshall algorithm

algorithm for finding all-pairs shortest paths in graphs, allowing some edge weights to be negative
Place pathfinding_algorithm Q1047576
Press Enter · cited answer in seconds

Floyd–Warshall algorithm

Summary

Floyd–Warshall algorithm is a pathfinding algorithm[1]. It draws 510 Wikipedia views per month (pathfinding_algorithm category, ranking #4 of 5).[2]

Key Facts

  • Floyd–Warshall algorithm is credited with the discovery of Bernard Roy[3].
  • Floyd–Warshall algorithm's image is recorded as Floyd-Warshall-Algorithm-Problem.png[4].
  • Floyd–Warshall algorithm's instance of is recorded as pathfinding algorithm[5].
  • Floyd–Warshall algorithm's instance of is recorded as graph algorithm[6].
  • Robert W. Floyd is named after Floyd–Warshall algorithm[7].
  • Stephen Warshall is named after Floyd–Warshall algorithm[8].
  • Floyd–Warshall algorithm's Commons category is recorded as Floyd-Warshall algorithm[9].
  • Floyd–Warshall algorithm's time of discovery or invention is recorded as +1959-00-00T00:00:00Z[10].
  • Floyd–Warshall algorithm's Freebase ID is recorded as /m/01hj8z[11].
  • Floyd–Warshall algorithm's different from is recorded as Floyd Cycle Detection Algorithm[12].
  • Floyd–Warshall algorithm's computes solution to is recorded as all-pairs shortest path problem[13].
  • Floyd–Warshall algorithm's uses is recorded as graph data structure[14].
  • Floyd–Warshall algorithm's MathWorld ID is recorded as Floyd-WarshallAlgorithm[15].
  • Floyd–Warshall algorithm's worst-case time complexity is recorded as O(|V|^3)[16].
  • Floyd–Warshall algorithm's best-case time complexity is recorded as O(|V|^3)[17].
  • Floyd–Warshall algorithm's average time complexity is recorded as O(|V|^3)[18].
  • Floyd–Warshall algorithm's worst-case space complexity is recorded as O(|V|^2)[19].
  • Floyd–Warshall algorithm's Rosetta Code page ID is recorded as Floyd-Warshall_algorithm[20].
  • Floyd–Warshall algorithm's Dictionary of Algorithms and Data Structures ID is recorded as floydWarshall[21].
  • Floyd–Warshall algorithm's maintained by WikiProject is recorded as WikiProject Mathematics[22].
  • Floyd–Warshall algorithm's Microsoft Academic ID is recorded as 186065694[23].
  • Floyd–Warshall algorithm's Brilliant Wiki ID is recorded as floyd-warshall-algorithm[24].
  • Floyd–Warshall algorithm's PlanetMath ID is recorded as FloydsAlgorithm[25].
  • Floyd–Warshall algorithm's OpenAlex ID is recorded as C186065694[26].

Body

Designation and Status

Recorded instance of include pathfinding algorithm[5] and graph algorithm[6].

History and Context

Things named after include Robert W. Floyd[7], a computer scientist[27], 1936–2001[28], of United States[29], awarded the Guggenheim Fellowship[30], specialised in computer science[31] and Stephen Warshall[8], a mathematician[32], 1935–2006[33], of United States[34].

Why It Matters

Floyd–Warshall algorithm draws 510 Wikipedia views per month (pathfinding_algorithm category, ranking #4 of 5).[2] It has Wikipedia articles in 21 language editions, a strong signal of global cultural recognition.[35] It is known by 41 alternative names across languages and contexts.[36]

References

Programmatic citations — every numbered marker resolves to a verifiable graph row below.

Direct Wikidata claims

  1. [4] . wikidata.org.
  2. [5] . wikidata.org.
  3. [6] . wikidata.org.
  4. [3] . wikidata.org.
  5. [7] . wikidata.org.
  6. [8] . wikidata.org.
  7. [9] . wikidata.org.
  8. [10] . wikidata.org.
  9. [11] . Freebase Data Dumps. wikidata.org.
  10. [12] . wikidata.org.
  11. [13] . wikidata.org.
  12. [14] . wikidata.org.
  13. [15] . wikidata.org.
  14. [16] . wikidata.org.
  15. [17] . wikidata.org.
  16. [18] . wikidata.org.
  17. [19] . wikidata.org.
  18. [20] . wikidata.org.
  19. [21] . wikidata.org.
  20. [22] . wikidata.org.
  21. [23] . wikidata.org.
  22. [24] . wikidata.org.
  23. [25] . wikidata.org.
  24. [26] . OpenAlex. Retrieved . docs.openalex.org. Provenance: wikidata.org.

Inline context (facts about related entities)

  1. [27] . Wikidata. wikidata.org. → on this site
  2. [28] . Wikidata. wikidata.org. → on this site
  3. [29] . Wikidata. wikidata.org. → on this site
  4. [30] . Wikidata. wikidata.org. → on this site
  5. [31] . Wikidata. wikidata.org. → on this site
  6. [32] . Wikidata. wikidata.org. → on this site
  7. [33] . Wikidata. wikidata.org. → on this site
  8. [34] . Wikidata. wikidata.org. → on this site

Class ancestry

  1. [1] . Wikidata. wikidata.org.

Aggregate / graph-position facts

  1. [2] . Wikimedia Foundation. dumps.wikimedia.org.
  2. [35] . Wikidata sitelinks. wikidata.org.
  3. [36] . Wikidata aliases. wikidata.org.

📑 Cite this page

Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.

APA 4ort.xyz Knowledge Graph. (2026). Floyd–Warshall algorithm. Retrieved May 3, 2026, from https://4ort.xyz/entity/floyd-warshall-algorithm
MLA “Floyd–Warshall algorithm.” 4ort.xyz Knowledge Graph, 4ort.xyz, 3 May. 2026, https://4ort.xyz/entity/floyd-warshall-algorithm.
BibTeX @misc{4ortxyz_floyd-warshall-algorithm_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{Floyd–Warshall algorithm}}, year = {2026}, url = {https://4ort.xyz/entity/floyd-warshall-algorithm}, note = {Accessed: 2026-05-03}}
LLM prompt According to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): Floyd–Warshall algorithm — https://4ort.xyz/entity/floyd-warshall-algorithm (retrieved 2026-05-03)

Canonical URL: https://4ort.xyz/entity/floyd-warshall-algorithm · Last refreshed: