1function topologicalSort(DAG):
2 compute in-degree for all vertices
3 queue = all vertices with in-degree 0
4 while queue not empty: u = queue.dequeue(); order.append(u)
5 for neighbor v of u: in-degree[v]--
6 if in-degree[v] == 0: queue.enqueue(v)
7 return order
No pseudocode line selected.