Definition A topological order of a Directed Acyclic Graphs is an ordering of its nodes so that for every edge (vi,vj) we have i<j