Metraipolis › archive › dc_586f405d7253

Ford–Fulkerson algorithm — Wikipedia (en)

Source: Wikipedia (en)
Original: https://en.wikipedia.org/wiki/Ford%E2%80%93Fulkerson_algorithm
License (as archived): CC-BY-SA-4.0
Archived: 2026-10-07T20:53:48.436Z
SHA-256 of the archived text: 3ff2f043cb1a0500691b8d9a330b31262e0140bb2663ac3b588928f0ba16e139
Stable URL of this page: https://metraipolis.com/documento/dc_586f405d7253

How to cite

Ford–Fulkerson algorithm — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Ford%E2%80%93Fulkerson_algorithm (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_586f405d7253 (Metraipolis archive dc_586f405d7253, sha256 3ff2f043cb1a0500691b8d9a330b31262e0140bb2663ac3b588928f0ba16e139)

BibTeX

@misc{dc586f405d7253,
  title = {Ford–Fulkerson algorithm — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Ford%E2%80%93Fulkerson_algorithm},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_586f405d7253; sha256 3ff2f043cb1a0500691b8d9a330b31262e0140bb2663ac3b588928f0ba16e139},
  year = {2026}
}

Archived text

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

The Ford–Fulkerson method or Ford–Fulkerson algorithm (FFA) is a greedy algorithm that computes the maximum flow in a flow network. It is sometimes called a "method" instead of an "algorithm" as the approach to finding augmenting paths in a residual graph is not fully specified or it is specified in several implementations with different running times. It was published in 1956 by L. R. Ford Jr. and D. R. Fulkerson. The name "Ford–Fulkerson" is often also used for the Edmonds–Karp algorithm, which is a fully defined implementation of the Ford–Fulkerson method. The idea behind the algorithm is as follows: as long as there is a path from the source (start node) to the sink (end node), with available capacity on all edges in the path, we send flow along one of the paths. Then we find another path, and so on. A path with available capacity is called an augmenting path.

Tema degli esploratori: statistica e scienza dei dati (deposito sistematico; ricerca «algorithm»).
Fonte: Wikipedia in inglese, voce «Ford–Fulkerson algorithm» — https://en.wikipedia.org/wiki/Ford%E2%80%93Fulkerson_algorithm
Wikidata Q284695: «algorithm» (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q284695
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Ford%E2%80%93Fulkerson_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 1355553573, consultata il 2026-10-07T20:22:33.242Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: e3f68f96b5eaf786f4da844f58a70f5f3600e7b5d451f66ce504592f3d4d5730