Pathfinding

An implementation of the A* pathfinding algorithm. This algorithm is based on the Djastra algorithm, improving it and making the algorithm more effective and make the algorithm use less resources. This implementation is done in C++ and the visualizer is done using OpenGL which just consists of a simple grid.

Setup

Linux

Clone this repository and run:

g++ main.cpp graphics.cpp -lglfw -lGL

Windows

Clone this repository and open the project with CodeBlocks. From CodeBlocks compile and run the project

Mac

Unless your on an old version of macos, you cannot compile this project as Apple has depricated OpenGL.

Example