|
|||||
|
|
| 基于最小树权矩阵法的改进算法 | |
| 引用本文： | 孙小军,刘三阳,焦建民.基于最小树权矩阵法的改进算法[J].计算机工程与设计,2005,26(12):3274-3275. |
| 作者姓名： | 孙小军 刘三阳 焦建民 |
| 作者单位： | 1. 西安电子科技大学,理学院,陕西,西安,710071;宝鸡文理学院,数学系,陕西,宝鸡,721007 2. 西安电子科技大学,理学院,陕西,西安,710071 3. 宝鸡文理学院,数学系,陕西,宝鸡,721007 |
| 基金项目： | 陕西省自然科学研究基金项目（2003A09） |
| 摘 要： | 针对最小树权矩阵法在大型网络应用中的不足，从提高算法效率方面对其进行了改进，并给出了新的算法。新算法减少了运算量，达到了快速寻找最小树的目的。通过对新算法和权矩阵法的比较，结果表明新算法具有较低的复杂度，是一种更为有效的算法。 |
| 关 键 词： | 网络 最小树 权矩阵 算法 复杂度 |
| 文章编号： | 1000-7024（2005）12-3274-02 |
| 收稿时间： | 2004-11-14 |
| 修稿时间： | 2004-11-14 |
Improved algorithm based on weight matrix method for minimum-spanning-tree problem |
|
| SUN Xiao-jun,LIU San-yang,JIAO Jian-min.Improved algorithm based on weight matrix method for minimum-spanning-tree problem[J].Computer Engineering and Design,2005,26(12):3274-3275. | |
| Authors: | SUN Xiao-jun LIU San-yang JIAO Jian-min |
| Abstract: | To correct the shortcomings of weight matrix method for the minimum-spanning-tree problem in applications of the large net-work,an new algorithm was presented,which was obtained by improving the efficiency of weight matrix method.The algorithm could reduce superfluous calculation and find the MST of the network more quickly.By comparing the two algorithms,the results show that the new algorithm has lower complexity and higher efficiency in finding the MST of the network. |
| Keywords: | network minimum spanning tree weigh matrix algorithm complexity |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ | |
