Algorithm idea
Breadth-First Search (BFS) is an uninformed search algorithm that explores the search space level by level.
It begins at the start node and systematically explores all neighboring nodes before moving to the next level of depth.
BFS uses a First-In-First-Out (FIFO) queue 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