Finding All the Minimum Spanning Tree with the "Minimum Difference Method" Algorithm

Minimum spanning tree algorithm is an important tool for network model for cost optimal solution. The problem of network connectivity is complex and changeable in real life, sometimes also need to pay attention to other targets.It is not enough to solve the problem with a minimum spanning tree. Therefore, it is necessary to find out all of the minimum spanning tree. It presents a new method of finding all of the minimum spanning tree — The minimum difference method. Undirected connected graph to generate the minimum spanning tree by removing the branches, the branches join a minimum spanning tree to a ring. This algorithm is, with even the branches of the right and the other branches of the ring for the poor, the minimum difference in a circle.Through judgment the minimum value whether is zero,the original judgment of minimum spanning tree can be swapped in and out of the side,to generate the minimum spanning tree of new.The algorithm can find out all the minimum spanning tree efficiently and regularly.Among all the minimum spanning tree scheme, select the minimum spanning tree scheme that tallied with the actual situation, the scheme is the optimum solution of the network cost.