My C++ and SFML 2.3.2 implementation of both Dijkstra's Algorithm and the A* Algorithm to find the shortest path in a grid.
View the Project on GitHub
My C++ and SFML 2.3.2 implementation of both Dijkstra’s Algorithm and the A* Algorithm to find the shortest path in a grid.