| 一种有向图中求取强分图和单项分图的算法 |
| |
| 引用本文： | 吴文权,谢科. 一种有向图中求取强分图和单项分图的算法[J]. 西南民族学院学报(自然科学版), 2007, 33(6): 1224-1228 |
| |
| 作者姓名： | 吴文权 谢科 |
| |
| 作者单位： | 阿坝师范高等专科学校数学系 四川汶川623000 |
| |
| 基金项目： | 四川省教育厅科研基金项目(2006C057). |
| |
| 摘 要： | 给出一种通过有向图可达矩阵求取强分图和单向分图的方法,此方法回避了结点的次序问题.
|
| 关 键 词： | 有向图 可达矩阵 强分图 单向分图 |
| 文章编号： | 1003-2843（2007）06-1224-05 |
| 收稿时间： | 2007-07-20 |
| 修稿时间： | 2007-07-20 |
A method to explore both strongly connected and unilaterally connected components from directed graph |
| |
| WU Wen-quan,XE Ke. A method to explore both strongly connected and unilaterally connected components from directed graph[J]. Journal of Southwest Nationalities College(Natural Science Edition), 2007, 33(6): 1224-1228 |
| |
| Authors: | WU Wen-quan XE Ke |
| |
| Abstract: | Avoiding considering the sequence of nodes,this paper proposes a new approach to work out both strongly connected and unilaterally connected components of a directed graph by using accesible matrix. |
| |
| Keywords: | directed graph accessible matrix strongly connected component unilaterally connected component |
| 本文献已被 CNKI 维普 等数据库收录！ |
