PA of Algorithms Q89

89In 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

Option : D
Explanation :
In case of unweighted, undirected graphs, BFS gives the most time efficient computation for shortest path. It is guaranteed to find first shortest path

Forgot your password?

I agree with the Terms.