(Solved) : C Programing Problem 27 Unweighted Bipartite Matching Time Limit 2 Seconds Problem Descrip Q29854092 . . . .

C++ programing problem 27

Unweighted Bipartite

Matching

Time Limit: 2 seconds

Problem Description

For an undirected graph G=( V, E ), if the points on G can bedivided into two groups, and the points in the group have no edgesdirectly connected to each other,This p is called a bipartitegraph.

Assuming that there is now a bipartite graph G, the points on Gcan be divided into X and Y groups. There is no direct connectionbetween any two points in the group.

For point Xi in groupX and point Y in Y group, if there is edgeconnected Xi and Yj, matching can be performed, but only one pointcan be

Pairing