Hungarian algorithm can be used to solve the bipartite matching problem , but it requires the bipartite graph to be completely symmetric. Hence we need to transform the original non-symmetric binary map matching problem into an absolute symmetric one.

Filename	Size	Update
新建文件夹 (3)\Edmonds.m	4325	2016-04-07
新建文件夹 (3)\hungarian.m	11786	2016-05-29
新建文件夹 (3)	0	2018-01-19

• 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．