一道算法题 伪代码解题

Question

The Edmonds-Karp algorithm for max flow finds shortest augmenting paths in the residual network. Consider the pseudo-code for Ford-Fulkerson on page 724 of your text, and replace the condition for the while-loop with pseudo-code that constructs the residual network Gf and then finds a shortest augmenting path p in that residual network. Your pseudo-code should run in O(E) time for each iteration of the while-loop.