Generates(randomly), visualizes, and solves mazes for the user. The whole program is presented to the user through a GUI.
- Uses Kruskal's MST algorithm to randomly generate valid(solvable) mazes.
- Uses Dijkstra's shortest path algorithm to find the shortest path between the start and end.
The visual components were created by other students. I implemented Dijkstra's algorithm and Kruskal's algorithm, as well as the min heap and disjoint sets data structures.
Sample of the program:
