Max Flow Algorithm Visualizer

Speed: 1x

Step: 0

Edmonds-Karp Algorithm
Uses BFS to find augmenting paths. Guarantees O(VE²) time complexity by always choosing the shortest augmenting path.

Max Flow: 0

Step Count: 0

Time: 0ms

Bulk Input:
• Line 1,2...: Node names (s, t, A, B...)
• Remaining: Edges as "sA:10", "At:15"
• First node = source, last = sink