CentralNotice Directed acyclic graph From Wikipedia, the free encyclopedia Jump to: navigation , search An example of a directed acyclic graph In mathematics and computer science , a directed acyclic graph ( DAG i / ˈ d æ ɡ / ), is a directed graph with no directed cycles . That is, it is formed by a collection of vertices and directed edges , each edge connecting one vertex to another, such that there is no way to start at some vertex v and follow a sequence of edges that eventually loops back to v again. [ 1 ] [ 2 ] [ 3 ] DAGs may be used to model many different kinds of information. The reachability relation in a DAG forms a partial order , and any finite partial order may be represented by a DAG using reachability. A collection of tasks that must be ordered into a sequence, subject to constraints that certain tasks must be performed earlier than others, may be...