In this exercise, you will complete a C++ implementation of Kruskal's MST (min spanning tree) algorithm. It consists of 3 modules (files): Edge.h, Kruskal.h, and main.cpp. Edge.h contains the definition of an edge object (including the weight associated with the edge). Kruskal.h is where the majority of the work needs to be accomplished. The following methods need to be completed: makeSet, sameSet, vertexSetUnion, process, getMSTCost. main.cpp contains code that demonstrates how one may use and test the MST algorithm. Submit your work via Canvas.
Note the boolean variables, verbose, are defined in Edge.h and Kruskal.h. If your code includes messages that are printed, only print them if verbose is true. (If you print messages without checking verbose, I will deduct points from your score.)