Application of Kruskal Algorithm Based on Union-find Sets in Subway Planning
Peng Jia-hong · Computer Knowledge and Technology · 2013
Minimum spanning tree has very good characteristics and been used extensively.This paper aims at three important op erations of Kruskal algorithm,sorting,adding edge as well as avoiding cycle,the later two operations are realized on the basis of union-find sets,then,the issue of cycle in the construction of minimum spanning tree is also solved with union-find sets and sorting.Kruskal algorithm based on union-find sets provides a solution for the planning of Changsha subway system.