directed acyclic graph DAG的意思|示意
有向无环图DAG
directed acyclic graph DAG的网络常见释义
有向无环图 不包含回路的有向图称为有向无环图(directed acyclic graph DAG)。一棵自由树(free tree)是不包含回路的连通 图。
有向无回图 ... directed acyclic graph 有向非循环图; 有向无环图 directed acyclic graph dag 有向无回图 directed acycline graph 有向无环图 ...
directed acyclic graph DAG相关短语
1、 directed acyclic graph dag structure 有向无环结构
2、 Directed Acyclic Graph Or DAG 因为它与有向无环图
3、 dag directed acyclic graph 有向无环图
directed acyclic graph DAG相关例句
At present the most popular model characterizing dependencies between tasks is DAG (directed acyclic graph).
目前任务调度算法中刻画任务依赖关系最流行的模型是DAG。
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.
对本体进行预处理，把本体表示为有向无环图，将本体分块问题转换为图分割问题。
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）。也就是说，在依赖结构中不允许出现环（ 循环依赖）。
Directed acyclic graph support vector (DAG - SVMS) multi - category classification methods, is a new multi - category classification methods.
有向无环图支持向量(DAG - SVMS)多类分类方法，是一种新的多类分类方法。