| 寻找最小生成树的补图算法 |
| |
| 引用本文： | 胡中波. 寻找最小生成树的补图算法[J]. 平顶山学院学报, 2004, 19(2): 12-13 |
| |
| 作者姓名： | 胡中波 |
| |
| 作者单位： | 孝感学院,湖北,孝感,432000 |
| |
| 摘 要： | 提出了一种关于最小生成树的生成法,该算法与传统的prim算法及kruskal算法比较,有更低的计算复杂性.
|
| 关 键 词： | 最小生成树 算法 权 |
| 文章编号： | 1008-5211(2004)02-0012-02 |
| 修稿时间： | 2004-02-15 |
On algorithm of producing minimum cost spanning trees by method of seeking complementary graph |
| |
| HU Zhong-bo. On algorithm of producing minimum cost spanning trees by method of seeking complementary graph[J]. Journal of Pingdingshan University, 2004, 19(2): 12-13 |
| |
| Authors: | HU Zhong-bo |
| |
| Abstract: | Presents an algorithm for finding minimum spanning trees.Compared with the traditional algorithm of Prim and Kruskal,the new algorithm has its own advantage. |
| |
| Keywords: | minimum spanning trees algorithm power |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
