A topological sort is carried out on a directed graph with no cycles. Such a graph is called a directed, acyclic graph, often abbreviated DAG.
拓扑排序必须在无环的有向图中进行。这样的图叫做有向无环图，缩写为DAG。
Directed acyclic graph support vector (DAG - SVMS) multi - category classification methods, is a new multi - category classification methods.
有向无环图支持向量(DAG-SVMS)多类分类方法，是一种新的多类分类方法。
Secondly, the program structure of high performance computing applications in the grid environment is analyzed and represented by the directed acyclic graph (DAG).
其次，分析了适用于网格环境的高性能计算应用的程序结构，并通过有向无循环图(DAG)加以表示。
The dependency structure between packages must be a directed acyclic graph (DAG). That is, there must be no cycles in the dependency structure.
包之间的依赖结构必须是一个直接的无环图形（DAG）。也就是说，在依赖结构中不允许出现环（循环依赖）。
The ontologies are represented in Directed Acyclic graph (DAG) structures by preprocessing. So, the ontology partition question is changed into a graph partition question.
对本体进行预处理，把本体表示为有向无环图，将本体分块问题转换为图分割问题。
At present the most popular model characterizing dependencies between tasks is DAG (directed acyclic graph).
目前任务调度算法中刻画任务依赖关系最流行的模型是DAG。
Virtual Laboratory of Cryptology based on Components(VLCC) uses topological sorting in Directed Acyclic Graph(DAG) to manage the data-dependant and execute-order between components.
基于组件的密码学虚拟实验室（VLCC）采用有向无环图（DAG）的拓扑排序机制管理组件。
The dependency structure between packages must be a directed acyclic graph (DAG).
包之间的依赖结构必须是一个直接的无环图形(DAG)。
The dependency structure between packages must be a directed acyclic graph (DAG).
包之间的依赖结构必须是一个直接的无环图形(DAG)。
应用推荐