| 有向连接图中节点可达的矩阵行取1算法 |
| |
| 引用本文： | 吕志宏,刘迎捷. 有向连接图中节点可达的矩阵行取1算法[J]. 浙江工业大学学报, 2000, 28(3): 280-282 |
| |
| 作者姓名： | 吕志宏 刘迎捷 |
| |
| 作者单位： | [1]西北建筑工程学院基础科学系,陕西西安 [2]西安幼儿师范学校,陕西西安 |
| |
| 摘 要： | 本文给出一种判断有向连接图中节点是否可达的算法，与一般相邻矩阵的布尔代数算法相比，具有简便快速的优点。
|
| 关 键 词： | 有向连接图 节点 可达矩阵 矩阵行取1算法 |
| 修稿时间： | 2000-03-01 |
An algorithm of the row of matrix by taking one for judging whether nodal points are reachable in directed graph |
| |
| LU Zhi|hong ,LIU Ying|jie. An algorithm of the row of matrix by taking one for judging whether nodal points are reachable in directed graph[J]. Journal of Zhejiang University of Technology, 2000, 28(3): 280-282 |
| |
| Authors: | LU Zhi|hong LIU Ying|jie |
| |
| Affiliation: | LU Zhi|hong 1,LIU Ying|jie 2 |
| |
| Abstract: | This paper presents an algorithm that is used to judge whether the nodal points in directed graph are reachable is. The algorithm is simple and fast as compared with the Boolean algebra algorithm of adjacency matrix. |
| |
| Keywords: | directed graph nodal points adjacency matrix reachable matrix |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
