In computer science and optimization theory, the max-flow min-cut theorem states that in a flow network, the maximum amount of flow passing from the source to the sink is equal to the total weight of the edges in a minimum cut, i.e., the smallest total weight of the edges which if removed would disconnect the source from the sink. For example, imagine a network of pipes carrying water from a reservoir (the source) to a city (the sink).
In computer science and optimization theory, the max-flow min-cut theorem states that in a flow network, the maximum amount of flow passing from the source to the sink is equal to the total weight of the edges in a minimum cut, i.e., the smallest total weight of the edges which if removed would disconnect the source from the sink. For example, imagine a network of pipes carrying water from a reservoir (the source) to a city (the sink).
Source: Wikipedia "Max-flow min-cut theorem" · CC BY-SA 4.0
Share this article: X · Bluesky