A directed acyclic graph, or DAG, is a graph where the edges are directed, i.e. point from one node to another in a specific direction, and where no cycles are present, i.e. nodes can only be traversed in one directed order.