6. Every weighted graph has a unique minimum spanning tree (MST).(A)O(B)X

問題詳情

6. Every weighted graph has a unique minimum spanning tree (MST).
(A)O
(B)X

參考答案

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

上一篇 : 5. Both depth-first search (DFS) and breadth-first search (BFS) are linear-time algorithrs.(A)O(B)X
下一篇 : 7. Given an adjacency-list representation of a directed graph G = (V, E, w), it takes O(V) time to c