Q35
What is the time complexity of performing a BFS on a graph with V vertices and E edges using an adjacency list?
A.
O(V2)
B.
O(E)
C.
O(V log V)
D.
O(V + E)
AnswerAnswer: Option D
Solution
Answer: Option D
No explanation is given for this question Let's Discuss on Board