有向图无向图 directed graph undirected graph
有向无环图 directed acyclic graph ; DAG ; DirectedAcyclieGraph ; DirectedAcyclicGraphic
无回路有向图 Directed Acyclic Graph
可能行无限的有向图 Possibly row-infinite directed graphs
有向无回图 directed acyclic graph
有向无圈图 directed acyclic graph ; DAG
有向无环图法 DAGSVM ; Directed Acyclic Graph ; DGA
有向无环图分类法 directed acyclic gragh
和有向无环图法 Directed Acyclic Graph ; DAG
Oozie工作流是放置在控制依赖DAG（有向无环图 Direct Acyclic Graph）中的一组动作（例如，Hadoop的Map/Reduce作业、Pig作业等），其中指定了动作执行的顺序。
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.
算法来找到一个层次树在一个有向无环图吗？
Algorithm to find a hierarchy tree in a directed acyclic graph?
这是存储唯一的路径通过一个有向无环图的现实？
Is it practical to store unique paths through a directed acyclic graph?
应用推荐