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