問題詳情

VIII Given the following graph, try to find its minimum spanning tree.


【題組】(a) What is the sixth edge that Kruskal's algorithm includes (the numbering of the inclusion orderstarts from 1, not 0)? __(14)__
(A) 6
(B) 7
(C)8
(D) 9

參考答案

答案：[無官方正解]
難度：計算中-1
書單：沒有書單，新增