題組內容

5. This question concerns with the Depth First Search (DFS) or Depth First Traversal algorithm.

(c) Refer to the pseudocode below for this question. Given a graph G, use your pseudocode in part (b) above to traverse G and print the order in which the vertices are visited. Your answer should be printed like this: (6%)