卷別

資料結構及演算法

選擇

國立政治大學 2025 · 考試 · 第 9 題

(4%) Given an undirected connected graph $G$ of $n$ vertices and $m$ edges, which of the following statement concerning spanning trees is false?

(A)
The minimum spanning tree should not include the heaviest edge in any cycle of $G$ .
(B)
The maximum spanning tree can be found by modifying Kruskal's algorithm to sort edges in descending order by weight.
(C)
Each spanning tree contains exactly $n-1$ edges.
(D)
Both Prim's and Kruskal's algorithms are greedy algorithms.
(E)
Heap is commonly used to implement Kruskal's Algorithm for finding minimum spanning tree efficiently.

標準解析

AI 已複查