演算法›Ch4 圖論演算法第 52 題／共 111 題
52. Max-Flow、Ford-Fulkerson、Min-Cut
#AL-04-052中Max-FlowFord-FulkersonMin-Cut
- Consider the residual flow network with a source vertex S and a sink vertex T given in the following figure. Apply the Ford-Fulkerson algorithm to it.
(a) (2%). Write down the augmenting paths used by the Ford-Fulkerson algorithm.
(b) (2%). Identify a minimum S-T cut for the network.
📄 交大112
▤完整推導請見《WH 資工筆記 · 演算法》Ch4 圖論演算法