問題詳情

25. Consider a graph as follows. Starting from node D, what is the visiting sequence of all nodes byusing depth-first-search. If you have multiple choices, just follow the alphabetical order.


(A) D, B, A, C, E, F, G, H, I
(B) D, F, G, I, H, E, B, C, A
(C) D, F, G, I, H, E, C, A, B
(D) D, B, A, C, E, H, I, G, F
(E) D, F, G, I, H, E, C, B, A

參考答案

答案：A
難度：計算中-1
書單：沒有書單，新增