Directed acyclic graph
From FLWiki
A directed acyclic graph (sometimes DAG) is a graph in which all edges have a single direction (like a one-way street) and there are no back edges. In other words, there are no loops. The basic model of a Flying Logic document is a directed acyclic graph, although Flying Logic does support special back edges used for modeling vicious or virtuous cycles.
