最大流问题的解决方法一般是利用`Ford-Fulkerson`算法，该算法伪码如下: ```csharp for each edge (u, v) ∈ E do f[u, v]←0 f[v, u]←0 end for while there exists a path P from s to t in the residual network Gf do cf (P)←mine∈P {cf (e)} for each edge (u, v) ∈ P do f[u, v]←f[u, v] + cf ...