What is a directed acyclic graph?
A directed acyclic graph, or DAG, is a type of directed graph that contains no directed cycles, meaning following its edge directions will never form a closed loop. These structures can be topologically ordered by arranging their vertices in a linear sequence consistent with all edge directions. They are widely applied across fields such as biology, information science, and computer science.
What we know
- A directed acyclic graph is a directed graph with no directed cycles consisting of vertices and edges directed from one vertex to another. [1, 2]
- Following the directions of the edges in a directed acyclic graph will never form a closed loop. [2]
- A directed graph is a DAG if and only if it can be topologically ordered by arranging vertices in a linear ordering consistent with all edge directions. [2]
- DAGs have numerous scientific and computational applications ranging from biology and citation networks to task scheduling. [2]
Where to go next
- how it workedHow does topological sorting work on DAGs?
- what followedWhat are the main applications of DAGs in computer science?
- the bigger pictureGraph theory fundamentals
- compared withHow does Dijkstra's algorithm handle directed graphs?
- a case in pointWhat is a bipartite graph?
- an unexpected connectionHow do family trees relate to graph theory?Family trees and evolutionary lineages are practical biological examples of directed acyclic graphs used to model ancestry without closed loops.
Sources
- [1]directed acyclic graph (Wikidata Q1195339) · CC0 1.0
- [2]Directed acyclic graph · CC BY-SA 4.0
- [3]Bipartite graph · CC BY-SA 4.0
- [4]Dijkstra's algorithm · CC BY-SA 4.0
- [5]Dual graph · CC BY-SA 4.0
Your path
- What is an eddy in fluid dynamics?
- What is the Mesa Falls Tuff?
- What were the powers of a Roman dictator?
- What physical properties are used to identify minerals?
- How do wind and water transport sediment?
- What did Francis Bacon write?
- What was the Diplomatic Revolution of 1756?
- What is a directed acyclic graph?