Given a connected graph with weighted edges, Kruskal's algorithm is a well-known greedy algorithm for selecting a spanning tree of minimum total weight (an MST). In fact, this algorithm applies to a more general class of objects, known as matroids. Matroids generalize graphs, as well as the notion of linear independence. Kruskal's algorithm has complexity O(m + n log(n)) on an n-vertex graph with...