Q. 6 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) preforming a BFS starting from S
Answer: (D)
Explanation:
