Ford-Fulkerson Bipartite Matching
for each edge (u,v) ∈ G.E (u,v).f = 0 G
f
= ResidualGraph(G) while there is an augmenting path in G p = AugmentingPath(G,s,t) for each edge (u,v) in p if (u,v) ∈ G.E (u,v).f = 1 else (v,u).f = 0