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 筆)
未解鎖
1. 題目解析 本題要求選擇一個算法，以...
阿摩線上測驗
登入
