演算法›Ch4 圖論演算法
第 5 題/共 111 題
◀ AL 5/111
5. MST、Cut Property
#AL-04-005中MSTCut Property

Let G=(V,E)G = (V, E) be a connected, undirected, weighted graph with distinct and positive edge weights. Let A⊆EA \subseteq E be a subset of edges that is contained in some minimum spanning tree of GG. Which of the following statements is always true?

📄 台大115
跳轉到第題
▤完整推導請見《WH 資工筆記 · 演算法》Ch4 圖論演算法
本章題號 · 1–20 / 111