Example of the Depth First Search (DFS) Algorithm Mark the starting node of the graph as visited and push it onto the stack While the stack is not empty Peek at top node on the stack If there is an unvisited child of that node Mark the child as visited and push the child node onto the stack Else Pop the top node off the stack Visited Nodes Example using the graph to the right. The stack push, peek and pop accesses the element on the right. Action Stack

There are no more unvisited nodes so the nodes will be popped from the stack and the algorithm will terminate.