A* is an informed search algorithm, or a best-first search, meaning that it is formulated in terms of weighted graphs: starting from a specific starting node of a graph, it aims to find a path to the given goal node having the smallest cost (least distance travelled, shortest time, etc.).
Download the .jar file located in the 'jar' folder and run it to use the Pathfinding Visualizer.
Controls:
- Start: hold 's' + left click
- End: hold 'e' + left click
- Create Wall: left click
- Delete Wall: right click
