In an unweighted, undirected connected graph, the shortest path from a node S to every other node is computed most efficiently, in terms of time complexity by
(A) Dijkstra’s algorithm starting from S.
(B) Warshall’s algorithm
(C) Performing a DFS starting from S.
(D) Performing a BFS starting from S.
Answer: (D)
Explanation: See Question 2 of https://www.geeksforgeeks.org/data-structures-and-algorithms-set-11/amp/
Quiz of this Question
GATE | GATE-CS-2007 | Question 41
Recommended Articles