更改

In mathematics, particularly graph theory, and computer science, a directed acyclic graph (DAG or dag ) is a directed graph with no directed cycles. That is, it consists of vertices and edges (also called arcs), with each edge directed from one vertex to another, such that following those directions will never form a closed loop. A directed graph is a DAG if and only if it can be topologically ordered, by arranging the vertices as a linear ordering that is consistent with all edge directions. DAGs have numerous scientific and computational applications, ranging from biology (evolution, family trees, epidemiology) to sociology (citation networks) to computation (scheduling).

In mathematics, particularly graph theory, and computer science, a directed acyclic graph (DAG or dag ) is a directed graph with no directed cycles. That is, it consists of vertices and edges (also called arcs), with each edge directed from one vertex to another, such that following those directions will never form a closed loop. A directed graph is a DAG if and only if it can be topologically ordered, by arranging the vertices as a linear ordering that is consistent with all edge directions. DAGs have numerous scientific and computational applications, ranging from biology (evolution, family trees, epidemiology) to sociology (citation networks) to computation (scheduling).

在数学，特别是图论和计算机科学中，有向无环图图(DAG 或 DAG)是一个没有有向圈的有向图。也就是说，它由顶点和边(也称为弧)组成，每条边都从一个顶点指向另一个顶点，这样沿着这些方向走永远不会形成一个闭合的循环。有向图是一个有向无环图当且仅当它可以通过将顶点按照与所有边方向一致的线性顺序排列而拓扑排序。DAGs 有许多科学和计算应用，从生物学(进化论，家族树，流行病学)到社会学(引文网络)到计算(调度)。

在数学，特别是<font color="#ff8000">图论</font>和<font color="#ff8000"> 计算机科学</font>中，有向无环图图(DAG 或 dag)是一个没有定向循环的有向图。也就是说，它由顶点和边(也称为弧)组成，每条边都从一个顶点指向另一个顶点，这样沿着这些方向走永远不会形成一个闭合的循环。有向图是一个有向无环图当且仅当它可以通过将顶点按照与所有边方向一致的线性顺序排列而拓扑排序。DAGs 有许多科学和计算应用，从生物学(进化论，家族树，流行病学)到社会学(引文网络)到计算(调度)。