演算法›Ch4 圖論演算法
第 94 題/共 111 題
◀ AL 94/111
94. Minimum Spanning Tree
#AL-04-094中Minimum Spanning Tree

The following statements about minimum spanning tree (MST) may or may not be correct. Assume that the weighted graph G=(V,E)G = (V, E) is undirected and connected. Do not assume that edge weights are distinct unless this is specifically stated. Chose the correct items.

📄 中央113
跳轉到第題
▤完整推導請見《WH 資工筆記 · 演算法》Ch4 圖論演算法
本章題號 · 81–100 / 111