This project is a visualization of the A* path finding algorithm.
Please click here to run the program on the browser.
This path finding visualizer consists of a grid on which the start and end nodes can be manually selected by the user. Once selected, the user can start the path finding procedure, which uses the A* path finding algorithm to calculate the shortest path between the two nodes. The user is able to draw any amount of obstacles on the grid. The clear button resets the path and empties the grid of any obstacles. The random button resets the path and randomly adds obstacles to the grid.