Controls
Speed
State
AlgorithmEdmonds-Karp
Max-flow value0
Last bottleneck—
Augmentations0
BFS phases0
Statusready
Event Log
Flow Network (label = flow / capacity)
edge (idle)
augmenting path
bottleneck edge
saturated
min-cut
level (Dinic)
Edmonds-Karp finds the shortest augmenting path with BFS and pushes its bottleneck. Dinic builds a level graph (BFS distances) and pushes a blocking flow with DFS. The classic CLRS network has maximum flow 23 and a minimum cut of capacity 23.