摘要
将Global optimization思想引入到寻找无向完全图最小生成树的问题中,提出了Global optimization算法。与Kruskal算法和Prim算法相比之下,此算法避免了求解过程中对生成树中是否出现回路的判断,并在一定程度上降低了时间复杂度。
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.
出处
《山东科学》
CAS
2006年第2期48-50,62,共4页
Shandong Science
基金
山东省自然科学基金重大项目(Z2004G02)
