This is homework project 7 for CSE373: Data Algorithms, instructed by Kasey Champion.
In this homework, Kruskal's algorithm is implemented to generate mazes and Dijkstra's algorithm is used to solve them.
Specifically, it includes four tasks:
- implemented disjoint set using the array-based representation. This includes making the optimizations with path compression and union-by-rank.
- implement the Graph constructor and numVertices and numEdges methods.
- implement findMinimumSpanningTree using Kruskal's algorithm and
- implement findShortestPathBetween using Dijkstra's algorithm.