A pathfinding algorithm implementation that uses the A* and Dijkstra's algorithm. It supports adding of walls and checkpoints along with the start and end nodes. You can also allow diagonal movement
Deployed at: https://jashith1.github.io/pathFindingAStar/
I wrote this back when I started high school so don't judge my code too much lol
Folders and files
| Name | Name | Last commit date | ||
|---|---|---|---|---|