(definition)
Definition: A graph with no path that starts and ends at the same vertex.
Generalization (I am a kind of ...)
graph.
Specialization (... is a kind of me.)
directed acyclic graph, tree.
See also cycle, feedback edge set, feedback vertex set.
Note: An acyclic undirected graphic is like a tree.
Author: PEB
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 19 April 2004.
HTML page formatted Mon Feb 2 13:10:39 2015.
Cite this as:
Paul E. Black, "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/acyclicgraph.html