一道算法题 伪代码解题

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.

阅读 2.1k
撰写回答
你尚未登录,登录后可以
  • 和开发者交流问题的细节
  • 关注并接收问题和回答的更新提醒
  • 参与内容的编辑和改进,让解决方法与时俱进
推荐问题