Depth-First Search

O(V + E)

Start

Speed

dfs(graph, start, visited): visited.add(start) for nb in graph[start]: if nb not in visited: dfs(graph, nb, visited)

Unvisited

On Stack

Exploring

Visited

Last In, First Out (LIFO)

Time	O(V + E)
Space	O(V)