A directed acyclic graph (DAG) is a type of graph that consists of vertices connected by directed edges, where there are no cycles, meaning you cannot return to the same vertex by following the direction of the edges.