How it works

• Select an algorithm from the dropdown.
• Draw walls or weighted nodes on the grid.
• Click Run to start the visualization.
• During execution, all controls are disabled to avoid interference.
• The algorithm explores nodes step by step.
• The final highlighted path represents the result.

What this tells us

• Different algorithms explore the grid in different ways.
• BFS finds the shortest path in unweighted grids.
• Dijkstra and A* correctly handle weighted nodes.
• A* usually explores fewer nodes due to heuristic guidance.
• DFS may find a path, but not necessarily the shortest one.
• Visualization helps compare efficiency using visited nodes and time.