In an unweighted, undirected connected graph, the shortest path from a node S…
PYQ GATE 2007
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.
Attempted by 387 students.
Sign up free to check your answer
Sign up freeLoading lesson…