演算法›Ch4 圖論演算法第 56 題／共 111 題
56. Minimum Spanning Tree、Kruskal
#AL-04-056中Minimum Spanning TreeKruskal
題組題幹（本題：⑫，共 3 小題）點擊展開
Given the graph with nodes labeled A to G and weighted edges, apply Kruskal's algorithm to find the minimum spanning tree (MST). The edges and their respective weights are as follows:
| Edge | A-B | A-D | B-C | B-D | B-E | C-E | D-E | D-F | E-F | E-G | F-G |
|---|---|---|---|---|---|---|---|---|---|---|---|
| Weight | 7 | 5 | 8 | 9 | 7 | 5 | 15 | 6 | 8 | 9 | 11 |
If the edge(s) with the lowest weight in the MST is(are) removed, which node pair(s) become disconnected?
📄 交大113
▤完整推導請見《WH 資工筆記 · 演算法》Ch4 圖論演算法