問題詳情

9.(15%) For the following graph, use Kruslcal algorithm to find out the minimum cost spanning tree

參考答案

答案:A
難度:簡單0.820329
統計:A(799),B(18),C(43),D(27),E(0)

內容推薦