Depth First

• The concept behind depth first search is to visit nodes as “deeply” into the graph as quickly as possible:

• Nodes in this graph are label in the order they are visited by a Depth First Traversal