☰
WH
·
CSBank
首頁
題庫專區
模擬考專區
Pro 方案
聯絡我們
首頁
題庫
模擬考
Pro
聯絡
總覽
資料結構
388
演算法
212
作業系統
290
計算機組織與結構
266
離散數學
161
線性代數
182
演算法
›
Ch4 圖論演算法
第 97 題／共 111 題
◀
AL 97/111
錯題回報
00:00
97. Maximum Flow
#AL-04-097
中
Maximum Flow
📝
☆
Which of the following statements about the Maximum Flow problem are incorrect?
A
In a flow network, source node has no incoming flow and terminal (sink) node has no outgoing flow.
B
Each edge has forward flow and backflow, and the two flows must always be inverses of each other.
C
Ford-Fulkerson algorithm finds the maximum flow from source to terminal with time complexity
O
(
E
f
)
O(Ef)
O
(
E
f
)
, where
E
E
E
represents the number of edges and
f
f
f
is the maximum flow of the final graph.
D
If we look at all the possible cuts in the graph, and find the largest capacity of those cuts, then that value is the value of the maximum flow for that network.
E
If a network has antiparallel edges (i.e., the edges connecting two nodes back and forth), we can convert it to an equivalent one with no antiparallel edges.
📝 寫筆記
📄 中央114
重做
跳轉到第
題
← 上一題
下一題 →
答案／解析
▤
完整推導請見《WH 資工筆記 · 演算法》Ch4 圖論演算法
‹
本章題號 · 81–100 / 111
›
全部 111
易 42
中 62
難 7
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
