13. Given two vertices, s and t, in a graph, which of the two traversals, breadth-first search (BFS) and
depth-first search (DFS), can be used to determine if there is a path from s to t?
(A) Only BFS
(B) Only DFS
(C) Both BFS and DFS
(D) Neither BFS nor DFS
答案:登入後查看
統計: A(0), B(1), C(5), D(0), E(0) #2847376
統計: A(0), B(1), C(5), D(0), E(0) #2847376