SPANNING TREE AND GRAPH C++ (use explanation and visualization if needed) and also provide an algorithm

Do not need to provide code or a description of the algorithm in that case.

Let G be a simple, undirected graph with positive integer edge weights. Suppose we want to find the maximum spanning tree of G. That is, of all spanning trees of G, we want the one with the highest total edge weight. If there are multiple, any one of them is fine to find.

Describe a simple algorithm to accomplish this.