directed acyclic graph

(redirected from Acyclic directed graph)
Also found in: Acronyms.

directed acyclic graph

(DAG) A directed graph containing no cycles. This means that if there is a route from node A to node B then there is no way back.
Mentioned in ?
References in periodicals archive ?
i) the transitive closure of a finite acyclic directed graph G = (V, E) is the finite poset (V, [right arrow]);
ii) the Hasse diagram of a finite poset P is the finite acyclic directed graph whose vertices are the elements of P and whose edges are the cover relations in P, i.