Biggest Flow

- Residual Graph - Biggest Stream Lowest cut - Ford-Fulkerson, O(E*f) f is value of biggest flow - Edmonds-karp, O(VE^2)   used BFS to find the path, p, from the Gf. p is shortest path from s to t ===

>>阅读原文<<