maxflow(G):

1. Find a shortest augmenting path
2. Update flow[][] so as to represent residual graph
3. Repeat until no augmenting path can be found