Topological Order
Definition
A topological order of a # Directed Acyclic Graphs is an ordering of its nodes so that for every edge $(v_i, v_j)$ we have $i < j$
A topological order of a # Directed Acyclic Graphs is an ordering of its nodes so that for every edge $(v_i, v_j)$ we have $i < j$