A

Admin • 828.03K Points
Coach

Q. Which is the correct technique for finding a maximum matching in a graph?

  • (A) dfs traversal
  • (B) bfs traversal
  • (C) shortest path traversal
  • (D) heap order traversal
Explanation by: Admin
the correct technique for finding a maximum matching in a bipartite graph is by using a breadth first search(bfs).

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Be the first to start discuss.