改进Kruskal算法仿真城市通信网络建设  

SIMULATING COMMUNICATION NET CONSTRUCTION AMONG CITIES WITH THE IMPROVED KRUSKAL ALGORITHM

作　　者：程树林[1] 钱萌[1] 

机构地区：[1]安庆师范学院计算机与信息学院,安徽安庆246011

出　　处：《计算机应用与软件》2008年第10期169-171,共3页Computer Applications and Software

基　　金：安徽省2007年高等学校省级重点教学研究项目(2007jyxm085)

摘　　要：给定城市间距离和费用的定性估计,研究其通信网络建设最小费用计算问题的计算机仿真方法。在保证各城市间能相互通信的前提下,构造分离集合改进Kruskal算法,仿真计算了网络建设最小费用,并得到了各城市间通信网络路径。应用VB6.0设计和实现了仿真程序,演算了一个具体的仿真算例,证明了算法的有效性和实用性并得到合理的结果,同时给出了其他多组仿真结果。此仿真方法对其他类似网络建设规划和费用计算问题具有较大的参考价值。The computer simulation method is studied, which computes the minimum construction cost of communication net, as for the given distance among cities and the qualitative estimation of cost. With the precondition of ensuring communication among cities, the minimum construction cost is computed by Kruskal algorithm which has been improved with constructed separate sets, and the communication net path among cities is gotten. The simulation programs are designed and implanted with VB6.0. One concrete simulation example is demonstrated, which gets reasonable results, and proves that the algorithm is effective and practical. Meanwhile, many other groups of simulation resuits are given. The simulation method provides certain referring-values for other similar net construction planning and Cost -calculation.

关 键 词：城市通信网络 分离集合 最小生成树 仿真 Kruskal 

分 类 号：TP391.9[自动化与计算机技术—计算机应用技术] TU984.205[自动化与计算机技术—计算机科学与技术]