1·G is a maximal acyclic graph.
是一个极大无圈图。
2·Algorithm to find a hierarchy tree in a directed acyclic graph?
算法来找到一个层次树在一个有向无环图吗？
3·Is it practical to store unique paths through a directed acyclic graph?
这是存储唯一的路径通过一个有向无环图的现实？
4·A Dryad job is a graph generator which can synthesize any directed acyclic graph.
Dryad job是个图形生成器，可以合成任意方向的无圈图。
5·The dependency structure between packages must be a directed acyclic graph (DAG).
包之间的依赖结构必须是一个直接的无环图形(DAG)。
6·What is the maximum number of possible topological sorts of N-order Direct Acyclic Graph?
的n阶有向无环图的拓扑排序的可能的最大数量是多少？
7·A product type hierarchy is a strict tree, whereas a category hierarchy can be a directed acyclic graph.
产品类型层次结构是一个严格的树，而类别层次结构则是一个有方向的非循环图表。
8·At present the most popular model characterizing dependencies between tasks is DAG (directed acyclic graph).
目前任务调度算法中刻画任务依赖关系最流行的模型是DAG。
9·Directed acyclic graph support vector (DAG - SVMS) multi - category classification methods, is a new multi - category classification methods.
有向无环图支持向量(DAG - SVMS)多类分类方法，是一种新的多类分类方法。
10·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。