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

相關試題

相關試卷