Q41
How is the time complexity of BFS affected when the graph is represented using an adjacency matrix?
A.
It becomes O(V log V).
B.
It becomes O(E log V).
C.
It remains O(V2).
AnswerD.
It becomes O(V + E).
Answer: Option C
Solution
Answer: Option C
No explanation is given for this question Let's Discuss on Board