directed acyclic graph

from The Free On-line Dictionary of Computing (8 July 2008)

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.

   (1994-12-07)