Concepts3
⚙️AlgorithmAdvanced
Minimum Cost Maximum Flow
Minimum Cost Maximum Flow (MCMF) finds the maximum possible flow from a source to a sink while minimizing the total cost paid per unit of flow along edges.
#minimum cost maximum flow#successive shortest augmenting path#reduced cost+11
⚙️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