(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
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified 19 April 2004.
HTML page formatted Fri Mar 25 16:20:34 2011.
Cite this as:
Paul E. Black, "directed acyclic graph", in
Dictionary of Algorithms and Data
Structures [online], Paul E. Black, ed.,
U.S. National Institute of
Standards and Technology. 19 April 2004. (accessed TODAY)
Available from: http://www.nist.gov/dads/HTML/directAcycGraph.html
