A Directed Acyclic Graph (DAG) is a type of graph that has the following characteristics: 1. **Directed**: The edges in the graph have a direction, meaning that they point from one vertex (or node) to another. This is often represented with arrows on the edges.
