BFS Shortest Path Demo (Unweighted Grid)

📍 BFS Shortest Path Demo (Unweighted Grid)

Click to set Start (🟩) and End (🟥), then click the button to find the shortest path.

☆ In pathfinding problems like grid navigation, we often use a strategy called BFS (Breadth-First Search).
☆ Here's how it works step-by-step:
- 🚦 Start from a node — usually the green 🟩 starting point you selected.
- 📏 Explore neighbors level-by-level — move to nearby unvisited cells in all directions (up, down, left, right).
- 🧠 Track the parent of each cell — so we can trace the path later.
- 🟥 Stop when the end is found — BFS ensures the shortest route is discovered first!
☆ This method guarantees the shortest path in an unweighted grid.