a finite directed graph with no directed cycles, meaning that it consists of vertices and edges, with each edge directed from one vertex to another, such that there is no way to start at any vertex v and follow a consistently-directed sequence of edges that eventually loops back to v again.

"DAGs are used in computer science to model processes with dependencies, such as task scheduling or data processing pipelines."