問題詳情
20. This question is about the max flow problem.
【題組】(58) Which of the following statements is wrong?
(A) By the Ford-Fulkerson algorithm we can find the maximum flow.
(B) Given a flow network G=(V, E), Edmonds-Karp algorithm has time complexity O(|V||E|2).
(C) The time complexity of Ford-Fulkerson algorithm depends on the capacity.
(D) If each edge has a different capacity, then there exists a unique minimum cut.
(E) The maximum flow is equal to the capacity of a minimum cut.
參考答案
答案：[無官方正解]
難度：計算中-1
書單：沒有書單，新增