| 用"破圈法"求全部最小生成树的算法 |
| |
| 引用本文： | 秦彦新,王越光. 用"破圈法"求全部最小生成树的算法[J]. 空军雷达学院学报, 2006, 20(2): 134-137 |
| |
| 作者姓名： | 秦彦新 王越光 |
| |
| 作者单位： | 湖北省行政学院信息网络中心,武汉,430022 |
| |
| 摘 要： | 求连通图的最小生成树是数据结构中讨论的一个重要问题．但在现实生活中，经常遇到如何得到连通图的所有最小生成树．针对此问题，运用“破圈法”思想，对所给的图进行约化，在约化图的基础上，提出了求全部最小生成树的算法，给出了应用例子．
|
| 关 键 词： | 数据结构 最小生成树 算法 |
| 文章编号： | CN42-1564（2006）02-0134-04 |
| 收稿时间： | 2005-12-14 |
| 修稿时间： | 2005-12-142006-02-20 |
Algorithm of Finding all Minimum Spanning Trees by Breaking Loop |
| |
| QIN Yan-xin,WANG Yue-guang. Algorithm of Finding all Minimum Spanning Trees by Breaking Loop[J]. Journal of Air Force Radar Academy, 2006, 20(2): 134-137 |
| |
| Authors: | QIN Yan-xin WANG Yue-guang |
| |
| Affiliation: | Information and Network Center, Hubei Administrative College, Wuhan 430022, China |
| |
| Abstract: | To find the minimum spanning trees in the connected graph is one of the important problems in the discussion of data structure. In actual life, however, how to get all minimum spanning trees by the connected graph usually occurs. As for this issue, the connected graph was simplified by using the idea of breaking loop. An algorithm of all minimum spanning trees was proposed and an example given as well, on the basis of the simplified graph. |
| |
| Keywords: | data structure minimum spanning tree algorithm |
| 本文献已被 维普 万方数据 等数据库收录！ |
|
