Define Minimum Spanning Tree
A minimum spanning tree of a weighted linked graph is its spanning tree of the smallest weight, where the weight of a tree is explained as the sum of the weights on all its edges.