(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 E. Black.
Entry modified Mon Apr 19 15:29:53 2004.
HTML page formatted Wed Oct 26 09:47:08 2005.
Cite this as:
Paul E. Black, "acyclic graph", from
Dictionary of Algorithms and Data
Structures, Paul E. Black, ed.,
NIST.
http://www.nist.gov/dads/HTML/acyclicgraph.html
