What would the time complexity to check if an undirected graph with V vertices and E edges isBipartite or not given its adjacency matrix?
A. O(E*E)
B. O(V*V)
C. O(E)
D. O(V)
Answer:B
What would the time complexity to check if an undirected graph with V vertices and E edges isBipartite or not given its adjacency matrix?
A. O(E*E) B. O(V*V) C. O(E) D. O(V)