Implementation of the A* pathfinding algorithm in Java. Shown in a GUI application. The program displays the shortest path from Point A to point B, going around any non-traversable (black) spaces.
Also displays heuristic distance from point B at any space on the grid observed by the algorithm.
###Compiling and Running:
- Compile .java files in the JButtonAStar directory
- Run with
java JButtonAStar.ButtonGrid
###Within the program
- Make spaces on the grid non-traversable using Shift + click
- Run the path-finding algorithm by clicking on point A.