Solution: Depth First Graph Traversal

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.