Challenge: Maximum Spanning Trees
Modify Kruskal's algorithm to find maximum spanning trees.
We'll cover the following...
The goal of this challenge is to implement an algorithm that computes the weight of a maximum spanning tree of a connected, weighted, and undirected graph. A maximum spanning tree is a spanning tree with the highest possible sum ...