摘要
最小连接问题在网络优化中有广泛的应用,找到快速有效的算法来构造最小生成树是解决问题的关键。该文提出了一种构造算法,在存储结构和排序方法两方面进行了改进。从理论上分析了算法的计算复杂度,并实际测试了算法运行时间。结果表明该算法较现有算法有了很大提高。
The smallest connection problem is widely used in network optimization.The key of solution is to find a minimum spanning tree with rapid and effective algorithm.This paper presents a new algorithm to construct minimum spanning tree.The store structure and the sort technique are optimized in this algorithm.Theoretical analysis and experiment results show the algorithm has less computational complexity.
出处
《计算机工程与应用》
CSCD
北大核心
2002年第3期54-55,共2页
Computer Engineering and Applications
基金
中国科学院青年创新基金(编号:ZJ00O01D)
