是一个极大无圈图。
Algorithm to find a hierarchy tree in a directed acyclic graph?
算法来找到一个层次树在一个有向无环图吗？
Is it practical to store unique paths through a directed acyclic graph?
这是存储唯一的路径通过一个有向无环图的现实？
A Dryad job is a graph generator which can synthesize any directed acyclic graph.
Dryad job是个图形生成器，可以合成任意方向的无圈图。
The dependency structure between packages must be a directed acyclic graph (DAG).
包之间的依赖结构必须是一个直接的无环图形(DAG)。
What is the maximum number of possible topological sorts of N-order Direct Acyclic Graph?
的n阶有向无环图的拓扑排序的可能的最大数量是多少？
A product type hierarchy is a strict tree, whereas a category hierarchy can be a directed acyclic graph.
产品类型层次结构是一个严格的树，而类别层次结构则是一个有方向的非循环图表。
At present the most popular model characterizing dependencies between tasks is DAG (directed acyclic graph).
目前任务调度算法中刻画任务依赖关系最流行的模型是DAG。
Directed acyclic graph support vector (DAG - SVMS) multi - category classification methods, is a new multi - category classification methods.
有向无环图支持向量(DAG-SVMS)多类分类方法，是一种新的多类分类方法。
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。
The dependency structure between packages must be a directed acyclic graph (DAG). That is, there must be no cycles in the dependency structure.
包之间的依赖结构必须是一个直接的无环图形（DAG）。也就是说，在依赖结构中不允许出现环（循环依赖）。
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.
在算法设计与实现中采用一个链接结构的“优先序列”，用它保证有向无回路图顶点的分层拓扑排序。
To solve the difficulty in modeling a chemical system a new node granularity transformation method based on object directed acyclic graph was proposed.
针对化工系统模型难以确定的问题，提出了基于对象的有向无环图节点粒度的转换方法。
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 ontologies are represented in Directed Acyclic graph (DAG) structures by preprocessing. So, the ontology partition question is changed into a graph partition question.
对本体进行预处理，把本体表示为有向无环图，将本体分块问题转换为图分割问题。
The set of jobs is specified using a directed acyclic graph, where each job is a node in the graph. Jobs are submitted to Condor following the dependencies given by the graph.
任务集是通过一个有向无环图来定义的，每个任务就是图中的一个节点。
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）的拓扑排序机制管理组件。
Oozie workflow is a collection of actions (i.e. Hadoop Map/Reduce jobs, Pig jobs) arranged in a control dependency DAG (Direct Acyclic Graph), specifying a sequence of actions execution.
Oozie工作流是放置在控制依赖DAG（有向无环图Direct Acyclic Graph）中的一组动作（例如，Hadoop的Map/Reduce作业、Pig作业等），其中指定了动作执行的顺序。
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.
描述了有向无回路图的构造性定义，指出问题一定有不超过所有任务执行时间总和的解。
The graph must be acyclic to avoid program scheduling deadlocks.
这个图必须是无环的，以避免造成调度上的死锁。
A subset of the vertex set of a graph is a feedback vertex set of the graph if the resulting graph is acyclic after removing the vertex subset from the graph.
若从一个图中去掉某些顶点后得到的导出子图是无圈图，则所去的那些顶点组成的集合就是原图的反馈点集。
The Acyclic Dependencies Principle: Allow no cycles in the package dependency graph.
在包的依赖关系图中不允许存在环。
The Acyclic Dependencies Principle: Allow no cycles in the package dependency graph.
在包的依赖关系图中不允许存在环。
应用推荐