M

Mr. Dubey • 100.69K Points
Coach

Q. 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)
  • (C) O(E)
  • (D) O(V)
Share

No solution found for this question.
Add Solution and get +2 points.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.


Question analytics