有向连接图中节点可达的矩阵行取1算法

An algorithm of the row of matrix by taking one for judging whether nodal points are reachable in directed graph

本文给出一种判断有向连接图中节点是否可达的算法 ,与一般相邻矩阵的布尔代数算法相比 ,具有简便快速的优点。

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.