# Solution Review: Depth First Graph Traversal

In this review, we learn how to write code for the Depth-First Traversal of a Graph

## We'll cover the following

## Solution #1: Iterative

The Depth-First Graph algorithm uses the idea of **backtracking**. We exhaustively search all the nodes by going ahead, if possible, or else by backtracking.

Here, the word ‘backtrack’ means to *move forward* as long as there are no more nodes in the current path, then move backwards on the same path to find nodes to traverse.

In the following solution, we have used a `stack`

to implement Depth-First Graph Traversal.

Level up your interview prep. Join Educative to access 80+ hands-on prep courses.