Intermediate
Data Structures & Algorithms
Q44 / 100
What is topological sorting?
Correct! Well done.
Incorrect.
The correct answer is B) A linear ordering of vertices in a DAG such that for every edge (u, v), u comes before v
B
Correct Answer
A linear ordering of vertices in a DAG such that for every edge (u, v), u comes before v
Explanation
Topological sort applies only to DAGs (directed acyclic graphs). It's used for scheduling tasks, build dependency resolution, and course prerequisites.
Progress
44/100