Metraipolis › archive › dc_360ac31370cd

Floyd–Warshall algorithm — Wikipedia (en)

Source: Wikipedia (en)
Original: https://en.wikipedia.org/wiki/Floyd%E2%80%93Warshall_algorithm
License (as archived): CC-BY-SA-4.0
Archived: 2026-10-07T11:58:21.902Z
SHA-256 of the archived text: 9226de415c568602485739e0cea49ee59822a4740b14905647ce86124f8d284e
Stable URL of this page: https://metraipolis.com/documento/dc_360ac31370cd

How to cite

Floyd–Warshall algorithm — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Floyd%E2%80%93Warshall_algorithm (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_360ac31370cd (Metraipolis archive dc_360ac31370cd, sha256 9226de415c568602485739e0cea49ee59822a4740b14905647ce86124f8d284e)

BibTeX

@misc{dc360ac31370cd,
  title = {Floyd–Warshall algorithm — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Floyd%E2%80%93Warshall_algorithm},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_360ac31370cd; sha256 9226de415c568602485739e0cea49ee59822a4740b14905647ce86124f8d284e},
  year = {2026}
}

Archived text

Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Floyd%E2%80%93Warshall_algorithm. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

In computer science, the Floyd–Warshall algorithm (also known as Floyd's algorithm, the Roy–Warshall algorithm, the Roy–Floyd algorithm, or the WFI algorithm) is an algorithm for finding shortest paths in a directed weighted graph with positive or negative edge weights (but with no negative cycles). A single execution of the algorithm will find the lengths (summed weights) of shortest paths between all pairs of vertices. Although it does not return details of the paths themselves, it is possible to reconstruct the paths with simple modifications to the algorithm. Versions of the algorithm can also be used for finding the transitive closure of a relation, or (in connection with the Schulze voting system) widest paths between all pairs of vertices in a weighted graph.

Tema degli esploratori: statistica e scienza dei dati (deposito sistematico; ricerca «algorithm»).
Fonte: Wikipedia in inglese, voce «Floyd–Warshall algorithm» — https://en.wikipedia.org/wiki/Floyd%E2%80%93Warshall_algorithm
Wikidata Q1047576 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q1047576
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Floyd%E2%80%93Warshall_algorithm?action=history).
Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza.
Estratto dell'introduzione non modificato nel contenuto; revisione 1368880655, consultata il 2026-10-07T11:28:36.152Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 6f087b65c41cff08155ef6bb6abb1ff44f5e45f960e25f9e7a8365ff4f327dc6