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。
Directed acyclic graph support vector (DAG - SVMS) multi - category classification methods, is a new multi - category classification methods.
有向无环图支持向量(DAG - SVMS)多类分类方法，是一种新的多类分类方法。
Secondly, the program structure of high performance computing applications in the grid environment is analyzed and represented by the directed acyclic graph (DAG).
其次，分析了适用于网格环境的高性能计算应用的程序结构，并通过有向无循环图(DAG)加以表示。
应用推荐