How does depth-first traversal work?
The Depth First Search algorithm algorithm traverses a graph in a depthward motion and remembers the stack to get the next vertex to start a search when a dead end occurs in any iteration.
