問題詳情
【題組】23. We find a spanning tree for the graph using the Prim's algorithm, starting with vertex e. Note that iftwo or more vertices qualify, then the one with the least alphabetical order is selected. What is thesum of the weights involved in the resulting tree?
(A) 30；
(B) 29；
(C)28；
(D) 27.
參考答案
答案：[無官方正解]
難度：計算中-1
書單：沒有書單，新增