Topological sort of a Directed Acyclic graph is?
A)always unique
B)always not unique
C)sometimes unique and sometimes not unique
D)always unique if graph has even number of vertices

Question

Quizplus · Accepted Answer

Topological sorting of a Directed Acyclic Graph (DAG) is sometimes unique and sometimes not unique. The uniqueness depends on the structure of the graph. If the graph has a linear ordering of its vertices such that for every directed edge uv from vertex u to vertex v, u comes before v in the ordering, then that is a valid topological sort. However, if there are multiple ways to order the vertices that satisfy this condition, then the topological sort is not unique.

Topological Sort of a Directed Acyclic Graph Is