How would one find the minimum spanning tree of a fully connected mesh with equal edge weights? Example:
All edges are undirected and weights are 1
