Concepts2
⚙️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
⚙️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