| 有向树图的连通性及其算法 |
| |
| 引用本文： | 刘瑞金,侯文华,翁莉娟.有向树图的连通性及其算法[J].北京工商大学学报(自然科学版),1995(1). |
| |
| 作者姓名： | 刘瑞金 侯文华 翁莉娟 |
| |
| 作者单位： | 天津大学数学系，北京轻工业学院数学教研室 |
| |
| 摘 要： | 证明了树形图图的连通性，给出了求全部树形图的广探算法。
|
| 关 键 词： | 树形图 有向路 Hamilton圈 |
THE CONNECTIVITY OF ARBORESCENCES GRAPH |
| |
| Liu Ruijin, Hou Wenhua.THE CONNECTIVITY OF ARBORESCENCES GRAPH[J].Journal of Beijing Technology and Business University:Natural Science Edition,1995(1). |
| |
| Authors: | Liu Ruijin Hou Wenhua |
| |
| Abstract: | This paper presents a new algorithm for finding all aborescences of a digraph,with vertex r as root.And,the conmectivity of the arborescences graph for a digraph isshown. |
| |
| Keywords: | Arborescence Directed path Hamilton Circuit |
| 本文献已被 CNKI 等数据库收录！ |
|
