The GATE Grind

GATE 2007 CS – Question 41

Algorithms · Graph Algorithms: Traversals, Minimum Spanning Trees, Shortest Paths · 2 marks · Multiple choice

In an unweighted connected undirected graph, what most efficiently computes shortest paths from S to all other nodes?

  1. Dijkstra from S
  2. Warshall
  3. DFS from S
  4. BFS from S

Practise this question in The GATE Grind →

Show answer and explanation

Correct answer: (D) BFS from S

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 →