Our project compares the A-star and Dijkstra's shortest path algorithms, using C++14 and the SFML library to visualize the shortest path between two nodes for a variety of random start and end nodes. This project was built upon the CMake SFML project template to streamline the implementation of our graph and visual code.
This project primariy relies on CMake to run SFML. From testing, this project runs best on Windows, gcc, and CLion. If SFML through CMake does not work, the library can be downloaded from the official website: https://www.sfml-dev.org/download/sfml/2.6.2/ . The SFML version used is 2.6.2. There is a font file (PixelTandysoft) used by the program inside the bin folder. It is important that it remains there for the visuals to display correctly.
The source code is dual licensed under Public Domain and MIT - See extended licenses under LICENSE.md