Q. What would the time complexity to check if an undirected graph with V vertices and E edges isBipartite or not given its adjacency matrix? (Solved)

1. O(E*E)

2. O(V*V)

3. O(E)

4. O(V)

  • b. O(V*V)
Subscribe Now

Get All Updates & News