Metraipolis › archive › dc_1ff6e271ae1c

Flow network — Wikipedia (en)

Source
Wikipedia (en)
Original
https://en.wikipedia.org/wiki/Flow_network
License (as archived)
CC-BY-SA-4.0
Archived
2026-10-07T11:39:00.652Z
SHA-256 of the archived text
819a0ed1de756927c9bd69280e54a14c6bbc85cd34ffa975ce43a1263740b12c
Stable URL of this page
https://metraipolis.com/documento/dc_1ff6e271ae1c

How to cite

Flow network — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Flow_network (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_1ff6e271ae1c (Metraipolis archive dc_1ff6e271ae1c, sha256 819a0ed1de756927c9bd69280e54a14c6bbc85cd34ffa975ce43a1263740b12c)
BibTeX
@misc{dc1ff6e271ae1c,
  title = {Flow network — Wikipedia (en)},
  howpublished = {Wikipedia (en)},
  url = {https://en.wikipedia.org/wiki/Flow_network},
  note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_1ff6e271ae1c; sha256 819a0ed1de756927c9bd69280e54a14c6bbc85cd34ffa975ce43a1263740b12c},
  year = {2026}
}

Archived text

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

In graph theory, a flow network (also known as a transportation network) is a directed graph where each edge has a capacity and each edge receives a flow. The amount of flow on an edge cannot exceed the capacity of the edge. Often in operations research, a directed graph is called a network, the vertices are called nodes and the edges are called arcs. A flow must satisfy the restriction that the amount of flow into a node equals the amount of flow out of it, unless it is a source, which has only outgoing flow, or sink, which has only incoming flow. A flow network can be used to model traffic in a computer network, circulation with demands, fluids in pipes, currents in an electrical circuit, or anything similar in which something travels through a network of nodes. As such, efficient algorithms for solving network flows can also be applied to solve problems that can be reduced to a flow network, including survey design, airline scheduling, image segmentation, and the matching problem.

Tema degli esploratori: matematica e informatica teorica (deposito sistematico; ricerca «graph theory»).
Fonte: Wikipedia in inglese, voce «Flow network» — https://en.wikipedia.org/wiki/Flow_network
Wikidata Q1412924 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q1412924
Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Flow_network?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 1371424498, consultata il 2026-10-07T11:19:02.049Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: edec3d67e735002219c7afd33bdf90c25d6663f78a8a45e3399230178937f400