The spanning subgraph of graph G is a subgraph containing all nodes of G. If the spanning subgraph of graph G is a tree, it is called the spanning tree of G, or called the spanning tree. The minimum spanning tree we usually call is the spanning tree with the smallest sum of edge weights among all spanning trees of graph G.

There are two algorithms for finding the minimum spanning tree: PRIM algorithm and Kruskal algorithm, both of which can be found on MATLAB code network.

You can download the relevant code from the programmer's joint development network or CSDN download channel.