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.

  1. A.

    Breadth first search; acyclic

  2. B.

    Topological sort; acyclic

  3. C.

    Breadth first search; cyclic

  4. D.

    Topological sort; cyclic

Attempted by 231 students.

Sign up free to check your answer

Sign up free

Explore the full course: Gate Guidance By Sanchit Sir

Loading lesson…