演算法›Ch4 圖論演算法
第 58 題/共 111 題
◀ AL 58/111
58. Max-Flow、Residual Network、Augmenting Path
#AL-04-058中Max-FlowResidual NetworkAugmenting Path
題組題幹(本題:⑭,共 2 小題)點擊展開

Consider the max-flow problem. Let G=(V,E)G=(V,E) be a network with edge capacity cec_e for all e∈Ee \in E and source-sink pair s,t∈Vs,t \in V.

Consider the following residual flow network.

Which of the following statements is/are true?

題目附圖
📄 交大113
跳轉到第題
▤完整推導請見《WH 資工筆記 · 演算法》Ch4 圖論演算法
本章題號 · 41–60 / 111