- Implemented a disjoint set data structure with recursive path compression. - Implemented Kruskal's algorithm to calculate the minimum spanning tree (MST) of a undirected weighted graph(utilized the DisjointSet class)