Yes, it does.
One method for computing the maximum weight spanning tree of a network G – due to Kruskal – can be summarized as follows.
- Sort the edges of G into decreasing order by weight. Let T be the set of edges comprising the maximum weight spanning tree. Set T = ∅.
- Add the first edge to T.
- Add the next edge to T if and only if it does not form a cycle in T. If there are no remaining edges exit and report G to be disconnected.
- If T has n−1 edges (where n is the number of vertices in G) stop and output T . Otherwise go to step 3.