Definitions for "Directed acyclic graph"
Keywords:  acyclic, dag, graph, arrows, nonempty
In programming, an abstract data type often used to represent arbitrary relationships between objects. The graph consists of nodes (data objects) connected by paths that have direction; there are no cycles in the graph. In object-oriented program design, DAGs are useful for depicting inheritance relationships among classes.
a collection of nodes (points or boxes) and edges (connector lines) often used in computer science to describe a sequence of computing events; a directed graph flows in a particular direction; a directed acyclic graph does not "double back" on itself.
an st graph if it has exactly one source and one sink