有向图中初级有向回路的求解算法及实例

An algorithm and example of solution to primary oriented circuits in a digraph

提出了Ｌ集合、Ｌ矩阵、连接积和通路矩阵的概念，给出通过构造通路矩阵序列Ｍｋ＝Ｍｋ－１＊Ｍ（ｋ＝２，…，ｎ）直接求出简单有向图中全部初级有向回路的求解算法及实例。

The concepts about L sets,L matrices,joining products and path matrices,are presented.The algorithm and examples of solution to all primary oriented circuits in a simple digraph by constructing the matrices sequences M k=M k-1 *M(k=2,…,n) are given.