A pathfinding simulator using SFML for comparing optimality and speed of Dijkstra and A* algorithms.
Github repository:-
https://github.com/UditSinghParihar/Pathfinding_Simulator YouTube video:-
Functionality:-
1. Allows to select the pathfinding algorithm between A* and Dijkstra.
2. Allows to place obstacle at any location.
