Finding the minimum spanning trees of undirected complete graph based on global optimization
Feifei Li · Shandong kexue · 2006
The idea of global optimization is introduced into the problem of finding the minimum spanning trees of(undirected) complete graph,then the Global optimization algorithm is represented in the paper.Compared with Kruskal(algorithm) and Prim algorithm,this algorithm avoids the judgement of the existence of loop in spanning trees and decreases the time complexity to a certain extent.