Open In App
Related Articles

GATE | GATE-CS-2007 | Question 41

Improve
Improve
Improve
Like Article
Like
Save Article
Save
Report issue
Report
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/

Quiz of this Question

Last Updated : 28 Jun, 2021
Like Article
Save Article
Previous
Next
Share your thoughts in the comments
Similar Reads