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
詳解 (共 1 筆)
未解鎖
一個圖中給定兩個頂點s和t,哪一種遍歷方...