Draft 138

A Directed Acyclic Graph (DAG) is a directed graph with no directed cycles.

That is, it consists of vertices connected by lines (edges), with each edge directed from one vertex to another, such that following those directions will never form a closed loop.