Ford-Fulkerson Bipartite Matching

Ford-Fulkerson(G,s,t):
1 for each edge (u,v) G.E
2
(u,v).f = 0
3 G = ResidualGraph(G)
4 while there is an augmenting path in G
5
p = AugmentingPath(G,s,t)
6
for each edge (u,v) in p
7
if (u,v) G.E
8
(u,v).f = 1
9
else
10
(v,u).f = 0
f