Question 36
Topological Sorting can be applied to which type of graph structure?
Topological ordering orders vertices linearly such that for every directed edge u -> v, u comes before v; this is valid only for DAGs. A DAG has at least one topological ordering. If a directed graph contains a directed cycle, no linear ordering can satisfy every edge's precedence constraint.