Directed acyclic graph
In mathematics, more specifically its branch graph theory, a directed acyclic graph is a kind of graph where each edge has a direction indicated by an arrow and no children is a parent of their descendants. More intuitively, this is a graph having a tree structure. It is also known by its shorthand dag.
The dag has an important application in computer science. For example, it is a common representation form of a syntax tree in constructing compilers.
