Ford-Fulkerson Algorithm Visualizer

Speed 3x

Step 0/0

Pseudocode

Edmonds-Karp

function FordFulkerson(G, s, t):
max_flow = 0
while (path = bfs(G, s, t)) exists:
min_cap = infinity
# Find bottleneck
for (u, v) in path:
min_cap = min(min_cap, cap(u,v)-flow(u,v))
# Augment flow
for (u, v) in path:
flow(u, v) += min_cap
flow(v, u) -= min_cap
max_flow += min_cap
return max_flow

Execution Log

Ready to start...

Time O(V·E²)

Space O(V+E)