This project implements various algorithms to find paths on maps as well as generate random new ones. Please do not hesitate to contact me for any information regarding this on my email [email protected].
Stanford University's standard C libraries have been used to develop the project. I wrote the main implementation files i.e. trailblazer.cpp Trailblazer/src folder.
This program displays various 2-dimensional worlds that represent either maps, mazes, or terrain and allows the user to generate paths in a world from one point to another. If you click on any two points in the world, the program will find a path from the starting position to the ending position. As it does so, it will color the vertexes green, yellow, and gray based on the colors assigned to them by the algorithm. Once the path is found, the program will highlight it and display information about the path weight in the console. The user can select one of five path-searching algorithms in the top menu:
- depth-first search (DFS)
- breadth-first search (BFS)
- Dijkstra's algorithm
- A* search
- Alternate Path The window also contains several controls. You can load mazes and terrains of different sizes (tiny, small, medium, large, and huge) from the bottom drop-down menu and then clicking the "Load" button.
You can also generate random mazes using the Kruskal's algorithm.