Question: What is a "topological sort" of a directed acyclic graph (DAG)?

Answer:

A topological sort of a directed acyclic graph (DAG) is a linear ordering of nodes such that for every directed edge (u, v), node u comes before node v.

MCQ: What is a "topological sort" of a directed acyclic graph (DAG)?

A. An arrangement of nodes in ascending order based on their values
B. An arrangement of nodes in descending order based on their values
C. A linear ordering of nodes such that for every directed edge (u, v), node u comes before node v
D. A linear ordering of nodes that connects all nodes in a graph

Correct Answer: A. An arrangement of nodes in ascending order based on their values

Explanation:

A topological sort of a directed acyclic graph (DAG) is a linear ordering of nodes such that for every directed edge (u, v), node u comes before node v.