Max-flow min-cut theorem
= Max-flow min-cut theorem
{wiki=Max-flow_min-cut_theorem}
The Max-flow Min-cut Theorem is a fundamental result in network flow theory, specifically in the context of directed (or undirected) graphs. It provides a deep relationship between two concepts: the maximum amount of flow that can be sent from a source node to a sink node in a flow network and the minimum capacity that, when removed, would disconnect the source from the sink.