Q13
What is the time complexity of the BFS algorithm for a graph represented using an adjacency list?
A.
O(E)
B.
O(V + E)
AnswerC.
O(V log V)
D.
O(E)
Answer: Option B
Solution
Answer: Option B
No explanation is given for this question Let's Discuss on Board