Abstract: For the case that the traditional Kruskal algorithm is unable to find all the minimum spanning trees(MST) when some edges have the same weights in the weighted graph, the improved algorithm about MST was proposed. Experimental results showed that the improved algorithm can give all the minimum spanning trees, which can provide a more comprehensive optimal decision-making scheme than that of  the traditional algorithm