(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 Wed Oct 30 12:15:30 2024.
Cite this as:
Paul E. Black, "directed acyclic graph", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 19 April 2004. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/directAcycGraph.html
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4