摘要
Abstract
The minimum spanning tree(MST)exerts a crucial role on a great deal of real⁃world applications. Kruskal algo⁃rithm is one of the commonly used algorithms to calculate MST. However,because of the repeating loop detections of Kruskal al⁃gorithm,in the practical application,the algorithm is more suitable to being employed directly in diagrams but not to using com⁃puter to reach the solutions. The implementation steps of the algorithm are discussed,and the related loop⁃detection algorithms are designed and analyzed in this paper to prove the correctness of the algorithms. The advantages and the disadvantages of the loop⁃detection algorithms,and range of application of each algorithm were found by applying computer programs to analyze the complexity of each algorithm and by testing their effectiveness.关键词
complexity analysis/MST/Kruskal algorithm/algorithm of loop-detectionKey words
complexity analysis/MST/Kruskal algorithm/algorithm of loop-detection分类
信息技术与安全科学
