directed acyclic graph

Noun

Meaning

directed acyclic graph (plural directed acyclic graphs)

(graph theory, computer science) A finite directed graph that contains no directed cycles.
Synonyms: acyclic digraph, acyclic directed graph, (acronym) DAG
Hyponyms: Bayesian network, tree

Source: en.wiktionary.org

Close letter words and terms

directability directable directed directed acyclic word graph directed by directed creation