NIST

directed acyclic graph

(definition)

Definition: A directed graph with no path that starts and ends at the same vertex.

Also known as DAG, acyclic directed graph, oriented acyclic graph.

Generalization (I am a kind of ...)
directed graph, acyclic graph.

See also cycle, feedback edge set, feedback vertex set.

Author: PEB


Go to the Dictionary of Algorithms and Data Structures home page.

If you have suggestions, corrections, or comments, please get in touch with Paul Black.

Entry modified 19 April 2004.
HTML page formatted Mon Nov 18 10:44:09 2013.

Cite this as:
Paul E. Black, "directed acyclic graph", in Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 19 April 2004. (accessed TODAY) Available from: http://www.nist.gov/dads/HTML/directAcycGraph.html