Concepts2
βοΈAlgorithmIntermediate
Min-Cut Max-Flow Theorem
The Max-Flow Min-Cut Theorem says the maximum amount you can push from source to sink equals the minimum total capacity you must cut to disconnect them.
#max flow#min cut#edmonds karp+12
βοΈAlgorithmIntermediate
Maximum Flow - Ford-Fulkerson
FordβFulkerson finds the maximum possible flow from a source to a sink by repeatedly pushing flow along an augmenting path in the residual graph.
#maximum flow#ford-fulkerson#edmonds-karp+10