| 一种无向图的生成树算法 |
| |
| 引用本文： | 陈语林,刘建成. 一种无向图的生成树算法[J]. 计算机工程与应用, 2002, 38(20): 115-116,119 |
| |
| 作者姓名： | 陈语林 刘建成 |
| |
| 作者单位： | 中南大学铁道校区计算中心,长沙,410075 |
| |
| 摘 要： | 求无向图的生成树是在网络和回路分析中经常遇到的重要问题。文章描述采用计算树的方法求解无向图的生成树,这种方法是通过列举生成树之间的差别来实现的。
|
| 关 键 词： | 算法 无向图 生成树 |
| 文章编号： | 1002-8331-(2002)20-0115-02 |
An Tree Generation Algorithm of Undirected Graphs |
| |
| Chen Yulin Liu Jiancheng. An Tree Generation Algorithm of Undirected Graphs[J]. Computer Engineering and Applications, 2002, 38(20): 115-116,119 |
| |
| Authors: | Chen Yulin Liu Jiancheng |
| |
| Abstract: | To enumerate all spanning trees in undirected graphs is an important problem that people frequently encounter in the analysis of network and cycle.The paper presents the method of seeking spanning trees of undirected graphs by adopting calculating trees which is realized by enumerating the difference among spanning trees. |
| |
| Keywords: | Algorithm Undirected graphs Spanning trees |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
