演算法›Ch4 圖論演算法
第 76 題/共 111 題
◀ AL 76/111
76. Maximum Cost Spanning Tree、MST
#AL-04-076中Maximum Cost Spanning TreeMST
題組題幹(本題:(b),共 2 小題)點擊展開

Given the following weighted undirected graph.

[3%] After generating a maximum cost spanning tree from this graph, which of the following statements is correct?

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