In this project, my partner Alex Ramos and myself implement Kruskal's and Djikstra's algorithm. We do this by using Minimum Heaps and our own implementation of Disjoint Sets. By doing this, we are able to create a randomized maze that is represented by a graph using Kruskal's, and then solve the maze using Djikstra's algorithm.

Our code is listed under the src folder, while the course-given code is listed under the out folder.

Note: This project was copied over from a Gitlab repository and had some added Gradle files used by the class staff. As a result, the project may not run correctly on this, and may need some fine tuning.