Max-Flow / Min-Cut — Ford–Fulkerson (2D)
Edmonds–Karp: BFS-based augmenting paths on a residual graph
Preset network
Classic textbook (6 nodes)
Bottleneck network
Diamond multi-path
Auto-run speed
Step ▸
Run to completion ⏵
Pause ⏸
Reset ↺
Current flow
0
Max flow
—
Augmenting paths
0
BFS iterations
0
Status
Ready
Press "Step" to run one Edmonds–Karp BFS iteration, or "Run to completion" to auto-play until no augmenting path remains.