Ford-Fulkerson algorithm: repeatedly find augmenting paths from source S to sink T, push flow along them. By the max-flow min-cut theorem, maximum flow = minimum cut capacity.