DAG: Topological sort Problem: TopoSort Input: A DAG(directed acyclic graph)G=(V, E) Output: A linear ordering of its vertices in such a way that if(v, w)E E, then v appears before w in e ordering 2/32021 Xiaojuan CaiDAG: Topological sort Problem: TopoSort Input: A DAG (directed acyclic graph) G = (V , E ) Output: A linear ordering of its vertices in such a way that if (v,w) ∈ E, then v appears before w in the ordering. 2/3/2021 Xiaojuan Cai 38