Starting from vertex A, DFS visits each adjacent node as far as possible before backtracking. Traversal preference is alphabetical for adjacent nodes.

Example Graph for DFS Traversal

DFS Traversal Steps

1. Visit A, mark as visited.
2. From A, visit B (next unvisited neighbor), mark as visited.
3. From B, visit E (unvisited neighbor), mark as visited.
4. From E, visit D (unvisited neighbor), mark as visited.
5. D has no unvisited adjacent nodes; backtrack to E.
6. From E, visit F, mark as visited.
7. From F, visit C, mark as visited.
8. From C, visit G, mark as visited.
9. Backtrack to C → F → E → B → A. All nodes are visited.

DFS Order

A → B → E → D → F → C → G