演算法›Ch4 圖論演算法
第 103 題/共 111 題
◀ AL 103/111
103. Minimum Spanning Tree、Kruskal's Algorithm、Prim's Algorithm
#AL-04-103易Minimum Spanning TreeKruskal's AlgorithmPrim's Algorithm

Given a weighted undirected graph G(V,E)G (V, E) below. Which of the following statement(s) about the minimum spanning tree (MST) of GG is (are) true?

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