Floyd–Warshall algorithm

algorithm for finding all-pairs shortest paths in graphs, allowing some edge weights to be negative
Pathfinding Algorithm Q1047576

Facts

11 properties

Identity

Instance of
pathfinding algorithm, graph algorithm[3]
More facts +10
Average time complexity
O(|V|^3)
Best-case time complexity
O(|S|^3)
Discoverer or inventor
Bernard Roy[2]
Time of discovery or invention
1959[6]
Worst-case space complexity
O(|V|^2)
Worst-case time complexity
O(|S|^3)
🏷️ Also known as
en Floyd–Warshall algorithm en Warshall–Floyd Algorithm ar خوارزمية فلويد-مارشل cs Floyd-Warshallův algoritmus cs Floydův-Warshallův algoritmus de Tripel-Algorithmus de Floyd-Warshall-Algorithmus de Algorithmus von Floyd und Warshall de Warshall-Algorithmus es algoritmo de Floyd-Warshall es Floyd Warshall es algoritmo de Floyd es algoritmo de Floyd Warshall es Floyd-Warshall fa الگوریتم Floyed-warshall fa الگوریتم وارشال fa الگوریتم فلوید-وارشال fa الگوریتم فلوید fi Floydin–Warshallin algoritmi fr algorithme de Floyd-Warshall
🔖 Identifiers · 9
OpenAlex ID
C186065694
Brilliant Wiki ID
floyd-warshall-algorithm
Dictionary of Algorithms and Data Structures ID
floydWarshall
Freebase ID
/m/01hj8z
Microsoft Academic ID (discontinued)
186065694
PlanetMath ID
FloydsAlgorithm
Rosetta Code page ID
Floyd-Warshall_algorithm

Report an error or request removal Lineage (PROV-JSON)

🔗 Connections
Named after 2
Different from 1
Discoverer or inventor 1
Maintained by WikiProject 1
Uses 1
← Different from 1
Press Enter · cited answer in seconds

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].

References

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

Direct Wikidata claims

  1. [3] ↑ . wikidata.org.
  2. [2] ↑ . wikidata.org.
  3. [4] ↑ . wikidata.org.
  4. [5] ↑ . wikidata.org.
  5. [6] ↑ . wikidata.org.
  6. [7] ↑ . wikidata.org.
  7. [8] ↑ . wikidata.org.
  8. [9] ↑ . wikidata.org.
  9. [10] ↑ . wikidata.org.

Inline context (facts about related entities)

  1. [11] ↑ . Wikidata. wikidata.org. → on this site
  2. [12] ↑ . Wikidata. wikidata.org. → on this site
  3. [13] ↑ . Wikidata. wikidata.org. → on this site
  4. [14] ↑ . Wikidata. wikidata.org. → on this site
  5. [15] ↑ . Wikidata. wikidata.org. → on this site
  6. [16] ↑ . Wikidata. wikidata.org. → on this site
  7. [17] ↑ . Wikidata. wikidata.org. → on this site
  8. [18] ↑ . Wikidata. wikidata.org. → on this site

Class ancestry

  1. [1] ↑ . Wikidata. 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 November 15, 2026, from https://4ort.xyz/entity/floyd-warshall-algorithm
MLA “Floyd–Warshall algorithm.” 4ort.xyz Knowledge Graph, 4ort.xyz, 15 Nov. 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-11-15}}
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-11-15)

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

Edit History

Rolling log of changes to this entity's Wikidata record. Values shown reflect the current state of each edited property — follow the history link to see the precise diff for any edit.

  1. 6w ago · ~2026-53049-41 · 2026-10-02 view diff on Wikidata ↗
    Best-case time complexity → O(|S|^3)
    Worst-case time complexity → O(|S|^3)
    "Changed claim: Worst-case time complexity: O(|S|^3)"
  2. 10w ago · VGMaintenanceBot bot · 2026-09-08 view diff on Wikidata ↗
    Instance of → pathfinding algorithm, graph algorithm
    Maintained by WikiProject → WikiProject Mathematics
    Different from → Floyd Cycle Detection Algorithm
    Uses → graph data structure
    + 3 other properties edited (see Wikidata diff for full list)
    "Added qualifier: MediaWiki page ID: 10831, Add qualifier to Rosetta Code page ID `Floyd-Warshall_algorithm`"
Live feed via Wikidata EventStreams. New edits appear within minutes of being made on Wikidata.