Ford-Fulkerson Max Flow
for each edge (u,v) ∈ G.E (u,v).f = 0 G
f
= ResidualGraph(G) while p = AugmentingPath(G,s,t) c
f
(p) = min { c
f
(u,v) : (u,v) ∈ p } for each edge (u,v) in p if (u,v) ∈ G.E (u,v).f = (u,v).f + c
f
(p) else (v,u).f = (v,u).f - c
f
(p)