有向无环图 Directed acyclic graph
（重定向自Acyclic Digraph）
在图论中，如果一个有向图无法从任意顶点出发经过若干条边回到该点，则这个图是一个有向无环图（DAG图）。
因为有向图中一个点经过两种路线到达另一个点未必形成环，因此有向无环图未必能转化成树，但任何有向树均为有向无环图。
Acyclic Digraph
中文百科
英语百科
Directed acyclic graph 有向无环图
（重定向自Acyclic Digraph）
In mathematics and computer science, a directed acyclic graph (DAG /ˈdæɡ/), is a directed graph with no directed cycles. That is, it is an object that consists of vertices and edges, with each edge directed from one vertex to another, such that there is no way to start at any vertex v and follow a consistently-directed sequence of edges that eventually loops back to v again. Equivalently, a DAG may be characterized as a directed graph that has a topological ordering, a sequence of the vertices such that every edge is directed from earlier to later in the sequence.
- Riemann geometry的意思
- Riemann, Georg Friedrich Bernhard的意思
- Riemann, Goorg Friedrich Bernhard的意思
- Riemann hypothesis的意思
- Riemannian的意思
- Riemannian connection的意思
- Riemannian geometries的意思
- riemannian geometry的意思
- riemanniangeometry的意思
- riemannian geomety的意思
- Riemannian manifold的意思
- Riemannian space的意思
- Riemannian space of constant curvature的意思
- Riemannian submanifold的意思
- Riemannian tensor的意思
- Riemann integral的意思
- Riemann invariant的意思
- Riemann invariants的意思
- riemannite的意思
- Riemann lower integral的意思
- Riemann manifold的意思
- Riemann mapping theorem的意思
- Riemann matrix的意思
- riemann measurable的意思
- riemann metering的意思