Q65
What would be the time complexity of the BFS traversal of a graph with n vertices and n1.25 edges?
A.
O(n)
B.
O(n1.25)
AnswerC.
O(n2.25)
D.
O(n*n)
Answer: Option B
Solution
Answer: Option B
No explanation is given for this question Let's Discuss on Board