AN EFFICIENT CIRCUIT VECTOR SPACE ALGORITHM FOR GENERATING ALL DIRECTED CIRCUITS OF A DIGRAPH
生成有向图全部有向回路的一个有效的回路向量空间算法

In this paper, an efficient circuit vector space algorithm is presented for enumerating directed circuits of a directed graph, by which every directed circuit is generated by the ring-sum of a fundamental circuit (directed circuit or semi-circuit) defined by a chord of the-cotree and a subset of the previously obtained directed circuits. At the same time every directed circuit in the digraph can be represented by a linear combination of a selected basic set of directed circuits.