| 双环网络G(N;1,s)直径的改进求解算法与实现 |
| |
| 引用本文： | 邰伟鹏. 双环网络G(N;1,s)直径的改进求解算法与实现[J]. 微电子学与计算机, 2007, 24(8): 46-48 |
| |
| 作者姓名： | 邰伟鹏 |
| |
| 作者单位： | 安徽工业大学,计算机科学系,安徽,马鞍山,243002 |
| |
| 摘 要： | 目前实现的双环网络G(N;1,s)直径求解算法的不足之处是利用数据库存取中间结果,严重影响了计算速度,当N值很大时需要计算的时间过长。针对这一不足,提出利用数组取代数据库来存取中间结果,实验结果表明,改进的算法极大地提高了计算速度;给出两例大值N直径分布图,并对直径分布特点作了进一步的分析。
|
| 关 键 词： | 双环网络 直径 紧优 算法 族 |
| 文章编号： | 1000-7180（2007）08-0046-03 |
| 修稿时间： | 2006-08-23 |
An Improved Algorithm to Calculate the Diameter of Double-Loop Networks G(N; 1, s) |
| |
| TAI Wei-peng. An Improved Algorithm to Calculate the Diameter of Double-Loop Networks G(N; 1, s)[J]. Microelectronics & Computer, 2007, 24(8): 46-48 |
| |
| Authors: | TAI Wei-peng |
| |
| Abstract: | At presented,an algorithm realized the calculation of the diameter of Double-loop networks G(N;1,s). But the disadvantage of this algorithm is using database technology to keep middle results. Where N becomes very large,it spends too much time to calculate. Therefore,an improved algorithm is presented who uses array to replace the database for keeping middle results. The result of experiments indicates that the improved algorithm improve the speed of calculation. Furthermore,Two distributing figure of large N's diameter is brought forth,and the character of diameter distributing is analyzed further. |
| |
| Keywords: | double-loop networks diameter tight optimal algorithm family |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
