directed acyclic graph


directed acyclic graph

(DAG) A directed graph containing no cycles. This meansthat if there is a route from node A to node B then there isno way back.