This project compares two different approaches to finding the minimal spanning tree of tree structures. I implemented both Prim's and Kruskal's algorithms and timed them for multiple sizes of trees. This was one the first major projects of mine in Java, and helped solidify my understanding of the language.