全部

1·Algorithm to find a hierarchy tree in a directed acyclic graph?

算法来找到一个层次树在一个有向无环图吗？

2·Is it practical to store unique paths through a directed acyclic graph?

这是存储唯一的路径通过一个有向无环图的现实？

3·A Dryad job is a graph generator which can synthesize any directed acyclic graph.

Dryad job是个图形生成器，可以合成任意方向的无圈图。

4·The dependency structure between packages must be a directed acyclic graph (DAG).

包之间的依赖结构必须是一个直接的无环图形(DAG)。

5·A product type hierarchy is a strict tree, whereas a category hierarchy can be a directed acyclic graph.

产品类型层次结构是一个严格的树，而类别层次结构则是一个有方向的非循环图表。

6·At present the most popular model characterizing dependencies between tasks is DAG (directed acyclic graph).

目前任务调度算法中刻画任务依赖关系最流行的模型是DAG。

7·Directed acyclic graph support vector (DAG - SVMS) multi - category classification methods, is a new multi - category classification methods.

有向无环图支持向量(DAG - SVMS)多类分类方法，是一种新的多类分类方法。

8·The dependency structure between packages must be a directed acyclic graph (DAG). That is, there must be no cycles in the dependency structure.

包之间的依赖结构必须是一个直接的无环图形（DAG）。也就是说，在依赖结构中不允许出现环（ 循环依赖）。

9·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.

在算法设计与实现中采用一个链接结构的“优先序列”，用它保证有向无回路图顶点的分层拓扑排序。

10·To solve the difficulty in modeling a chemical system a new node granularity transformation method based on object directed acyclic graph was proposed.

针对化工系统模型难以确定的问题，提出了基于对象的有向无环图节点粒度的转换方法。