The GATE Grind

GATE 2007 CS – Question 5

Algorithms · Graph Algorithms: Traversals, Minimum Spanning Trees, Shortest Paths · 1 mark · Multiple choice

For the shown DAG with V={1, 2, 3, 4, 5, 6}, which is NOT a topological ordering?

Diagram for GATE 2007 CS question 5
  1. 1 2 3 4 5 6
  2. 1 3 2 4 5 6
  3. 1 3 2 4 6 5
  4. 3 2 4 1 6 5

Practise this question in The GATE Grind →

Show answer and explanation

Correct answer: (D) 3 2 4 1 6 5

Explanation

We are sorry we couldn't write detailed soluition for this, we are working on it!, please consider asking your own AI, its just 2-3 clicks with very minimum effort

More Graph Algorithms: Traversals, Minimum Spanning Trees, Shortest Paths questions

All Graph Algorithms: Traversals, Minimum Spanning Trees, Shortest Paths questions →