Ford-folkerson算法 _图论算法

最初, 值的流为0。找到一些扩充路径p, 并通过剩余容量cf（p）在p的每个边缘上增加流f。当不存在增加路径时, 流量f为最大流量。

FORD-FULKERSON METHOD (G, s, t) 1. Initialize flow f to 0 2. while there exists an augmenting path p 3. do argument flow f along p 4. Return f

FORD-FULKERSON (G, s, t) 1. for each edge (u, v) ∈ E [G] 2. do f [u, v] ← 0 3. f [u, v] ← 0 4. while there exists a path p from s to t in the residual network Gf. 5. do cf (p)←min?{ Cf (u, v):(u, v)is on p} 6. for each edge (u, v) in p 7. do f [u, v] ← f [u, v] + cf(p) 8. f [u, v] ←-f[u, v]

示例：每个定向边都标记有容量。使用Ford-Fulkerson算法查找最大流量。