Depth First Search (Algorithm)

$\text{DFS}(G)$:

1. Select root vertex and add to a Stack (ADT)
2. While stack is not-empty:
   1. Inspect top element $u$ on the stack
   2. Add any unvisited neighbours of $u$ to the stack
   3. Remove $u$ from the stack