If there is a subset M in the edge set E (G) of G, if any two edges in M are not adjacent, then M is a match of graph G. The match with the largest number of edges is called the maximum matching, and the number of edges contained in the maximum matching is called the maximum matching number. When G is a two point graph, the problem is very special. This is the problem we want to solve -- the biggest two points matching.

Filename	Size	Update
最大二分配法\get_augument_chain.m	796	2018-06-04
最大二分配法\get_Gf.m	245	2018-06-02
最大二分配法\Max_Bipartite_Matching.m	1205	2018-06-10
最大二分配法\m_grPlot.m	7721	2018-05-23
最大二分配法\m_transMatrix.m	301	2018-05-23
最大二分配法	0	2018-06-10

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．