This program utilizes different pathfinding algorithms from graph theory to find the shortest path from one node to another. Some of the algorithms used are Dijkstra's, A*, and Breath First search. The program is written completely in java utilizing the built in graphics api. The drawing of the panel is done in the graphics thread, which all the computations are done in a separate thread. There are synchronization blocks throughout the computation thread as well as the drawing thread to ensure there are no race conditions, which was one of the problems that occured during implementation.
- Open Pathfinding folder in Intelij and press run
- Select the size and type of pathfinding algorithm
- Key Commands
- s: Place start node
- e: Place end node
- w: place walls
- Enter: Run the selected pathfinding algorithm
- When program is running, colors will appear to represent the following:
- Magenta: found and selected node
- Yellow: found but not selected node
- BLUE: Represents the path found by the algorithm
- Window on right of GUI explaining the key controls
- More Pathfinging Algorithms
 |
 |
 |