← Back to Learn
Max Flow
Find the maximum flow through a network using Edmonds-Karp (BFS-based Ford-Fulkerson). Watch augmenting paths push flow until no more paths exist.
0/7
speed
6
nodes
9
edges
0
max flow
—
path flow
nodes 6
seed ⓘ 42
setup
Network: 6 nodes, 9 edges. Find max flow from S to T using BFS (Edmonds-Karp).
complexity
O(VE²)