Depth first traversal

How it works

Before traversal, assume all vertices are marked as unvisited at the start

Points to consider

• need to pick starting node
• visit each node once

Pseudocode

• DFT(V)
• mark V as visited
• for each unvisited neighbour U of V:
• DFT(U)