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 ?