Example: nodes, edges. Edges: (,,), (,,), (,,), (,,), (,,). First BFS finds path with bottleneck . Flow becomes . Next BFS finds path with bottleneck . Flow becomes . No more paths exist from to in the residual graph.
Maximum flow is . The algorithm systematically finds all paths and uses them efficiently. Each augmentation increases the total flow until no improvement is possible.