This paper presents an algorithm that is used to judge whether the nodal points in directed graph are reachable is.

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