試題詳解

21. We find a spanning tree for the graph using the depth-first search algorithm, starting with vertex e. Note that if two or more vertices qualify, then the one with the least alphabetical order is selected. What is the sum of the weights involved in the resulting tree?
(A) 31；
(B) 32；
(C)33；
(D) 34.