Network

Run Edmonds–Karp

Flow: 0

Statistics

Current flow value0
Min-cut capacity—
Augmenting paths0
BFS iterations0
StatusReady
Press Step to run one Edmonds–Karp iteration. BFS finds the shortest augmenting path (highlighted); flow is pushed along its bottleneck. When no path remains, the min cut is revealed — its capacity equals the max flow.