在此基础上，提出一个同时生成有向图的有向回路基集和全部有向回路的算法。
A search algorithm for finding simultaneously the basic sets and whole body of directed circuits is presented.
在算法设计与实现中采用一个链接结构的“优先序列”，用它保证有向无回路图顶点的分层拓扑排序。
A "priority queue" which has a linked structure is used in this algorithm, which insures to complete LTP with the vertices in directed acyclic graph.
由此提出一个生成有向图的全部有向回路的算法。
On the basis of the discussions, an algorithm for finding all directed circuits from walk matrix of digraph is presented.
该算法能系统地，无重复地生成有向图的全部有向回路。
It generates all circuits systematically, without duplication and in groups.
该算法能系统地，无重复地生成有向图的全部有向回路。
It generates all circuits systematically, without duplication and in groups.
应用推荐