/AStar

Implementations of the A* pathfinding algorithm

Primary LanguageJava

AStar

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.

Usage

###Compiling and Running:

  1. Compile .java files in the JButtonAStar directory
  2. Run with java JButtonAStar.ButtonGrid

###Within the program

  1. Make spaces on the grid non-traversable using Shift + click
  2. Run the path-finding algorithm by clicking on point A.