題組內容

6.

(10%) b. Analyze the complexity of depth-first search (DFS) on a graph represented by the adjacency list or adjacency matrix, respectively.