Q114
What would the time complexity to check if an undirected graph with V vertices and E edges is Bipartite or not given its adjacency matrix?
A.
O(E*E)
B.
O(V*V)
AnswerC.
O(E)
D.
O(V)
Answer: Option B
Solution
Answer: Option B
No explanation is given for this question Let's Discuss on Board