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 - Dinic's Algorithm
Dinic's algorithm computes maximum flow by repeatedly building a level graph with BFS and sending a blocking flow using DFS.
#dinic#maximum flow#blocking flow+11