从而解决了求有向回路基集的有效算法问题。
Thus, the problem of efficiently finding the basic set of directed circuits in a digraph is solved.
由此提出一个生成有向图的全部有向回路的算法。
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.
网格法是有向回路法的改进算法，利用了多边形的方向性和区域划分。
Grid method is an improved algorithm of the directed-loop method: it utilizes the orientation of the polygon and region partition at the same time.
在此基础上，提出一个同时生成有向图的有向回路基集和全部有向回路的算法。
A search algorithm for finding simultaneously the basic sets and whole body of directed circuits is presented.
引入资源回路和有向辅助弧的概念，通过对其活性进行控制而提高系统的可靠性。
A concept of resource loop and directed assistant arc are drawn into to improve reliability by controlling its activity.
在算法设计与实现中采用一个链接结构的“优先序列”，用它保证有向无回路图顶点的分层拓扑排序。
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.
回路矩阵是一个资源有向图全部资源回路的代数描述，并且它与补集及t -特征向量矩阵相互等价。
Circle matrix is the algebraic description of all the resource circles in a directed graph, and equivalence reciprocally to that one of complementary set and T-characteristic vector.
在一定条件下简单有向图的完全关联矩阵中列向量线性相关时，它们对应的边构成回路。
In some condition, if column vectors in a complete incidence matrix are not linearly independent, these sides which are denoted by the column vectors formed a circuit.
接着把这一特殊的指派问题用有向无回路图表示出来，从而使指派问题的求解转化为求解有向无回路图的划分问题。
Then the assignment problem is illustrated with the directed acyclic graphs. The assignment problem becomes the partition problem of directed acyclic graphs.
描述了有向无回路图的构造性定义，指出问题一定有不超过所有任务执行时间总和的解。
A constructible definition of the directed acyclic graph was described, and the reason why exists a solution that does not exceed the total execution time of all tasks was explained.
本文提出一种在有向图中求全部有向哈密尔顿回路的新算法。
In this paper a new algorithm for finding all directed Hamiltonian circuits in a digraph is presented.
本文提出一种在有向图中求全部有向哈密尔顿回路的新算法。
In this paper a new algorithm for finding all directed Hamiltonian circuits in a digraph is presented.
应用推荐