在算法设计与实现中采用一个链接结构的“优先序列”，用它保证有向无回路图顶点的分层拓扑排序。
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.
接着把这一特殊的指派问题用有向无回路图表示出来，从而使指派问题的求解转化为求解有向无回路图的划分问题。
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.
该算法能系统地，无重复地生成有向图的全部有向回路。
It generates all circuits systematically, without duplication and in groups.
该算法能系统地，无重复地生成有向图的全部有向回路。
It generates all circuits systematically, without duplication and in groups.
应用推荐