Start
End
Wall
Visited
Path
How it works:
A* Algorithm: Uses heuristics (Manhattan distance) to guide the search towards the goal. More efficient than Dijkstra.
Dijkstra: Explores all directions equally. Guaranteed to find the shortest path but slower.
Instructions: Click and drag to draw walls, then click Visualize to see the algorithm in action!