1) graphs(mathematics)/directed circuit
图(数学)/有向回路
2) directed acyclic graph
有向无回路图
1.
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.
描述了有向无回路图的构造性定义,指出问题一定有不超过所有任务执行时间总和的解。
2.
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.
在算法设计与实现中采用一个链接结构的"优先序列",用它保证有向无回路图顶点的分层拓扑排序。
3) directed circuit
有向回路
4) directed graph circuit algorithm
有向图的回路算法
5) cycle in directed graph
在有向图形中的回路
6) circuits (mathematics)
回路(数学)
补充资料：基本回路矩阵(见网络图论)
基本回路矩阵(见网络图论)
fundamental loop matrix
!!匕e门hu}}目luZhen基本回路矩阵(fundamerttal 10叩matrix 见网络图论。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条