The GATE Grind

GATE 2008 CS – Question 19

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

BFS uses a queue. Which is a possible vertex visitation order for the shown graph?

Diagram for GATE 2008 CS question 19
  1. MNOPQR
  2. NQMPOR
  3. QMNPRO
  4. QMNPOR

Practise this question in The GATE Grind →

Show answer and explanation

Correct answer: (C) QMNPRO

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 →