In mathematics, particularly graph theory, and computer science, a directed acyclic graph (DAG) is a directed Graph#1.3.6.1.4.1.33097.1.0.14 with no directed Cycles#1.3.6.1.4.1.33097.1.0.12.5. DirectedAcyclicGraphs may take the form of a single NodeNetwork#1.3.6.1.4.1.33097.1.0.12 or NodeNetworkSet#1.3.6.1.4.1.33097.1.0.15 with more than one NodeNetwork#1.3.6.1.4.1.33097.1.0.12.
https://en.wikipedia.org/wiki/Graph_theory