Directed Acyclic Graph (DAG) mathematically a DAG is a graph that travels in one direction without cycles connecting the other edges. This means it is impossible to traverse the entire graph starting at one edge. The edges of the directed graph only go one way. The graph is a topological sorting, where each node is in a certain order.
Imagine a collection of individual transactions where each transaction is linked to at least one other transaction in the following way: