Max-flow min-cut theorem

ID: 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.

New to topics? Read the docs here!