Search Algorithm Visualizer

A visualizer to visualize the concept of Breadth First Search, Depth First Search, and A* Path finding algorithm.

Usage:

1. First left mouse click places the start point on the grid
2. Second left click places the end point
3. Further left clicks adds barrier on the grid
4. Right click to remove the start, end point or the barrier.
5. After all the points have been placed, press 'D' for Depth First Search, 'B' for breadth first search, and 'A' for A* Search.
6. To clear the screen, press 'C'.

Color Key:

TURQUOISE - Start point ORANGE - End point BLACK - Barrier RED - Visited node GREEN - Nodes currently in the open set PURPLE - Path