Research on minimum spanning tree based on prim algorithm

In the minimum spanning tree algorithm of graph, Prim and Kruskal algorithm are respectively applied to dense graph and sparse graph.But both cannot dynamically regulate their own capability based on peak number, edge number and edge distribution.Prim starts from the degree of the vertex and then delete some useless edges from the graph.Therefore, improvement on the Prim algorithm, enabling it dynamically regulates its capability, can be applied to both dense graph and sparse graph.After experiments, the method by improving on the Prim algorithm can effectively reduce the search space and have the advantage of speed and so on.