First page
Back
Continue
Last page
Graphics
Recursive DFS
Algorithm:
Dfs(v) { mark v as visited; for (each unvisited vertex u adjecent to v) dfs(u) }