Algorithm idea
Similar to BFS, Depth-First Search (DFS) is an uninformed search algorithm that explores as far as possible along each branch before backtracking.
At each step, DFS moves to an unvisited neighbor of the current node.
If it reaches a node with no unvisited neighbors, it backtracks to the previous node to explore a different branch. DFS uses a Last-In-First-Out (LIFO) stack to manage the frontier.
Guide
Drag the START(😊) and TARGET(🏠) icons to change their positions, and click on the blank nodes to add Walls.
Start Node
Target Node
Wall
Visited
Shortest Path