Pathfinding algorithm in C++ / Qt for school project.
Authors :
- Jan Steiner
- Anasse El Boudiri
- Henrique Marques Reis
This project implements 3 pathfinding algorithms in C++ :
- Random Walk
- A* algorithm
- Dijkstra algorithm
It also includes a maze generator using the Prim algorithm.
The project is built using CMake and the GUI is built using Qt. A CI/CD pipeline is setup but not functional on Github (project initially hosted on Gitlab).
You can run the executable located in the executable folder named youKnowDaWay.exe
Here is an example of the application running :
The GUI is simple, you can choose :
-
to generate a new maze
-
the pathfinding algorithm you want to use
-
to compare the running time of the 3 algorithms on the actual maze.
The start point is the green square, the end point is the red square. The blue zone is all the path discovered by the algorithm. The yellow zone is the final path found by the algorithm.