Directed Acyclic Graphs

Last updated Jan 24, 2022 Edit Source

• Cs data structures

There is a special name for directed Graphs without any cycles, directed acyclic graphs, or DAGs. For a DAG, there is an ordering of its vertices $v_1,v_2,…v_n$ such that for any edge $(v_i,v_j)$, $i<j$. If such an ordering exists, the graph is a DAG.