AlgoViz
—
← Back to the lesson
🧩 Puzzle · Apply DFS

Go deep

Explore this graph the way depth-first search does: from the current node (purple), always plunge into an unvisited neighbour. Only when the current node has no unvisited neighbours do you backtrack. The amber nodes are your legal moves right now.

Start = A · go deep, backtrack only when stuck
ABCDEFG
A is the current node. Click an unvisited neighbour to go deeper.
Purple = current node. Amber = where you can go deeper. Green = visited.path: A