A C++ pathfinding visualization algorithm using SDL2 i686 version

Press 1 to use Dijkstra's Algorithm to guarantee the shortest path
Press 2 to use A* pathfinding algorithim to guarantee the shortest path

Controls:
Mouse1: Add walls
LShift: Add starting point
Z: Add ending point
X: Delete point (Must delete starting/ending point in order to create another one)
D: Erase board
1: Start the Dijkstra's pathfinding algorithim
2: Start the a* pathfinding algorithim