問題詳情
【題組】22. We find a spanning tree for the graph using the breadth-first search algorithm, starting with vertexe. 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) 40；
(B) 39；
(C)38；
(D) 37.
參考答案
答案：[無官方正解]
難度：計算中-1
書單：沒有書單，新增