WH LogoWH·CSBank
演算法›Ch4 圖論演算法
第 36 題／共 111 題
◀ AL 36/111
36. Max-Flow、Edge-Disjoint Paths
#AL-04-036中Max-FlowEdge-Disjoint Paths
  1. (10%) (a) (4%) Given a graph G(V,E)G(V,E), show how to find the maximum number of edge disjoint paths from the source ss to the sink tt. This means that you should construct a set of paths such that each edge appears in at most one path. Consider the following example with s=1,t=6s=1, t=6. What is the maximum number of edge-disjoint paths?
題目附圖
📄 交大114
跳轉到第題
← 上一題下一題 →
▤完整推導請見《WH 資工筆記 · 演算法》Ch4 圖論演算法
本章題號 · 21–40 / 111
2122232425262728293031323334353637383940