(6) Each time the BFS module is invoked, you will find a shortest path which will augment the current total flow by a positive amount. Augmenting the flow will change the capacity graph along the path just found. Use that modified capacity graph and residual flow network to find the next augmenting path.
(7) The input should be an adjacency list. The output is the value of maximum flow.
hmm34
commented
10 years ago
(6) Each time the BFS module is invoked, you will find a shortest path which will augment the current total flow by a positive amount. Augmenting the flow will change the capacity graph along the path just found. Use that modified capacity graph and residual flow network to find the next augmenting path.
(7) The input should be an adjacency list. The output is the value of maximum flow.