問題詳情
16. Which of the following algorithms can be used to most efficiently determine the presence of a cycle in a given graph?
(A) Depth First Search (DFS)
(B)Breadth First Search (BFS)
(C) Prim's Minimun Spanning Tree (MST) Algorithm
(D) Kruskal's Minimum Spanning Tree (MST) Algorithm
參考答案
答案：[無官方正解]
難度：計算中-1
書單：沒有書單，新增