personal project
Purpose
I created this project to show the efficiency difference between the A* and Dijkstra's path finding algorithms.
Summary
The user first chooses which of the two algorithms to use, then with the first two clicks chooses the start and end node. The user can then draw barriers that the algorithm must work around. After pressing the space bar, the visualizer will initiate and determine the quickest path from the start to the end node represented by the pink colored path when the algorithm finishes
Source Code