Q17
What is a topological sort in a directed graph?
A.
A minimum spanning tree of the graph.
B.
A breadth-first search traversal of the graph.
C.
A depth-first search traversal of the graph.
D.
A linear ordering of vertices such that for every directed edge u -> v, vertex u comes before v.
AnswerAnswer: Option D
Solution
Answer: Option D
No explanation is given for this question Let's Discuss on Board