Description: 图论当中的KM匹配算法，考虑到两个图大小不一的情况了，非常经典-Graph theory which KM matching algorithm, taking into account the situation of the two map sizes, and very classic Platform: |
Size: 11264 |
Author:xxx |
Hits:
Description: 图论中二分图匹配求最佳匹配的KM算法，用c实现，简单易懂-Graph Theory in the bipartite graph matching the best match for KM algorithm, with c realize, easy-to-read Platform: |
Size: 1024 |
Author:cdw |
Hits:
Description: C++语言下, 关于图论算法的一些模版, 包括一般图最大匹配, km匹配, 最小割等等, 共15个模版-C++ language under the graph theory algorithm on a number of templates, including the maximum matching in general graph, km matching, minimum cut, etc., a total of 15 templates Platform: |
Size: 11264 |
Author:jz |
Hits:
Description: KM算法，很好的用于求二分图的最优匹配问题-KM algorithm, very good for seeking the optimal bipartite graph matching problem Platform: |
Size: 1024 |
Author:张久 |
Hits:
Description: 本实列是基于匈牙利算法和KM算法的二分图匹配.-The actual column is based on Hungarian and KM bipartite graph matching algorithm. Platform: |
Size: 6144 |
Author:王创举 |
Hits:
Description: 二分图最佳匹配算法，使用KM算法的邻接矩阵的实现-Bipartite graph matching algorithm is the best use of KM implementation of the adjacency matrix algorithm Platform: |
Size: 1024 |
Author:Tiny |
Hits:
Description: Kuhn-Munkers算法的几种变形应用
1.Kuhn-Munkers算法是求最大权完备匹配，如果要求最小权完备匹配怎么办？方法很简单，只需将所有的边权值取其相反数，求最大权完备匹配，匹配的值再取相反数即可。
2.Kuhn-Munkers算法的运行要求是必须存在一个完备匹配，如果求一个最大权匹配(不一定完备)该如何办？依然很简单，把不存在的边权值赋为0。
3.Kuhn-Munkers算法求得的最大权匹配是边权值和最大，如果我想要边权之积最大，又怎样转化？还是不难办到，每条边权取自然对数，然后求最大和权匹配，求得的结果a再算出e^a就是最大积匹配。
-Several variations of the application Kuhn-Munkers algorithm
1.Kuhn-Munkers algorithm is seeking maximum weight perfect matching, if the requirements of the minimum weight perfect matching how to do? The method is very simple, just all weights whichever side opposite number, the right to seek the most complete, the matching values can then take the opposite number.
Operational requirements 2.Kuhn-Munkers algorithm is there must be a complete match, if seeking a maximum weight matching (not necessarily complete) how to do? Is still very simple, the edge weights assigned a value that does not exist is 0.
3.Kuhn-Munkers maximum weight matching algorithm is obtained and the maximum value of edge weights, if I want to plot the right side of the largest, but also how to transform? Is not difficult, each side the right to take the natural logarithm, and then find the maximum and the right to match the results of a re-calculated to obtain e ^ a product is the greatest match.
Platform: |
Size: 1024 |
Author:蓝星超 |
Hits:
Description: 本程序实现了KM算法，通过一对一匹配实现最大化边权值之和。(This program implements the KM algorithm, through one to one matching to maximize the sum of edge weights.) Platform: |
Size: 1024 |
Author:ruqiu_0904
|
Hits:
Description: KM算法可以计算二分图的最大权匹配，匈牙利算法可以计算最大匹配(KM algorithm can calculate the maximum weight matching of bipartite graphs, Hungary algorithm can calculate the maximum matching.) Platform: |
Size: 1024 |
Author:xxxlll32 |
Hits:
Search - matching KM algorithm