Are you sure you're getting this? Fill in the missing part by typing it in.
Topological Sorting for a DAG is a linear ordering of vertices such that for every directed edge a --> b, node a comes __ b in the ordering.
Write the missing line below.
