DAG: Topological sort TOPOLOGICAL-SORT(G 1. Call DES(G)to compute finishing times of each vertex v 2 As each vertex is finished insert it onto the front of a linked list 3. Return the linked list of vertice 2/32021 Xiaojuan CaiDAG: Topological sort TOPOLOGICAL-SORT(G) 1.Call DFS(G) to compute finishing times of each vertex v 2.As each vertex is finished, insert it onto the front of a linked list 3.Return the linked list of vertices. 2/3/2021 Xiaojuan Cai 41