Minimum Spanning Tree is the problem of finding a set of edges that can connect all the vertices in a undirected graph with the minimal sum of edge weights.