A minimum spanning tree algorithm based on binary coding

We can only get a minimum spanning tree from all the spanning trees with the current minimum spanning tree algorithm, So we hope to present a new algorithm to improve it. The new algorithm is mainly use the binary code and the characteristics of the minimum spanning tree to get all the minimum spanning trees. At first, It eliminates some of the non spanning trees according to the number of the graph edges. What is more, It eliminates some of the non-spanning trees according to the judgement of the graph connectivity. In fact, the nature of the algorithm is to look for the best in the global scope. At last, we can find all the minimum spanning trees of the connected graph in view of the algorithm. An example shows that the algorithm has clear steps, convenient program implementation and general good characteristic.