Title :
The Application of Union-Find Sets in Kruskal Algorithm
Author :
Pan, Da-Zhi ; Liu, Zhi-Bin ; Ding, Xian-Feng ; Zheng, Qin
Author_Institution :
Coll. of Mathematic & Phys., Southwest Pet. Univ., Chengdu, China
Abstract :
It is the key of Krusal Algorithm to select edges and judge loop. Though realized path-compression in operation of searching tree of Union-Find Sets Data Structure, and optimized merging-operation which the shallower tree has been merged into the deeper tree, the operation of selecting edges and judging loop in Krusal Algorithm is optimized and the time complexity of algorithm is reduced. Compared with the common way, the programming operation time of the new way has been reduced to some 1/10.
Keywords :
algorithm theory; computational complexity; data structures; Krusal algorithm; path compression method; time complexity; union-find sets data structure; Anodes; Artificial intelligence; Computational intelligence; Costs; Data structures; Mathematics; Merging; Petroleum; Physics; Tree data structures; Kruskal algorithm; minimum cost spanning tree; path-compression; union-find sets;
Conference_Titel :
Artificial Intelligence and Computational Intelligence, 2009. AICI '09. International Conference on
Conference_Location :
Shanghai
Print_ISBN :
978-1-4244-3835-8
Electronic_ISBN :
978-0-7695-3816-7
DOI :
10.1109/AICI.2009.155
