Q2
What is the time complexity of Breadth-First Search (BFS) on a graph with V vertices and E edges?
A.
O(V + E)
AnswerB.
O(V2)
C.
O(E log V)
D.
O(V log V)
Answer: Option A
Solution
Answer: Option A
No explanation is given for this question Let's Discuss on Board