acyclic graph (original) (raw)

NIST

(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

Go to theDictionary 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 Wed Oct 30 12:15:30 2024.

Cite this as:
Paul E. Black, "acyclic graph", inDictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 19 April 2004. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/acyclicgraph.html