3.7.81. Directed acyclic graph

A constraint that forces the final graph to be a directed acyclic graph. A directed acyclic graph is a digraph with no path starting and ending at the same vertex.