A_____takes a directed ______ graph G and produce a linear ordering of all its…
A_____takes a directed ______ graph G and produce a linear ordering of all its vertices such that for every directed edge in G, the vertex v comes before the vertex w in the ordering.
- A.
Breadth first search; acyclic
- B.
Topological sort; acyclic
- C.
Breadth first search; cyclic
- D.
Topological sort; cyclic
Attempted by 231 students.
Sign up free to check your answer
Sign up freeLoading lesson…

