1function DFS(graph, start):
2 stack.push(start)
3 while stack is not empty:
4 node = stack.pop()
5 if node not visited:
6 visit(node)
7 mark node as visited
8 for neighbor in graph[node] (reversed):
9 if neighbor not visited:
10 stack.push(neighbor)
No pseudocode line selected.