SFML community forums
General => SFML projects => Topic started by: warriorUSP on January 15, 2019, 06:39:51 pm
-
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:- https://www.youtube.com/watch?v=9qLElqkVqLA&t=31s
Functionality:-
1. Allows to select the pathfinding algorithm between A* and Dijkstra.
2. Allows to place obstacle at any location.