生成有向图的有向通路和有向回路的一个新算法

An Algorithm for Finding all Directed Circuits and Directed Walk from Its Digraph

本文首先定义了顶点的边、度关系矩阵，由此形成通路矩阵。证明了通路矩阵生成有向通路和有向回路的条件，提出了一个系统地。

In this paper, some relationship between the directed circuits, degree of a vertex, and adjacent edge; and theproperty that directed circuits can be generated diagonal element of walk matrix etc, are extensively studied. On the basis ofthe discussions, an algorithm for searching all directed circuits from walk matrix of digraPh is presented. Using this algorithm,all circuits can be generated systematically, without duplication and clustering into groups.