A directed-acyclic graph (or DAG) is a special type of graph that is (1) directed, and (2) does not contain any directed cycles. In simpler terms, it means that if we follow the edges of the graph, we will never form a closed loop. A directed tree would be a common example of a directed acyclic graph.