A python based visualizer for A* pathfinding algorithm.
Select the start and end point by clicking any of the box in the grid. (First click corresponds to the start point and the Second click corresponds to the end point)
Then click anywhere in the grid to draw obstacles in the path that the algorithm has to avoid.
Press Space
to start the visualization of the algorithm and see the result (the shortest path possible) drawn by the algorithm.
Press Enter
to clear the grid and draw new maps to play with.