Max-Flow / Ford-Fulkerson

Finds maximum flow from source (S) to sink (T) using augmenting paths (BFS = Edmonds-Karp). Min-Cut theorem: max flow = min cut capacity.

Network size: 8 nodes Max capacity: 10 New Random Network Step (one augmenting path) Solve (max flow) Reset Flow