搜索资源列表
kmMatch.rar
- KM算法，实现二分图的最优匹配。 可实现最大匹配或者最小匹配。,KM algorithm, bipartite graph to achieve the optimal match. Can achieve maximum or minimum match to match.
hgr
- 求二分图最大匹配 匈牙利算法-Seeking the maximum bipartite graph matching for bipartite graph maximum matching algorithm Hungary
tulunkeshe
- 图论课程设计 二部图 欧拉回路 呈上分享 希望有帮助-Graph theory, curriculum design, bipartite graph Euler circuit brought to share the hope that help
hungary
- 求最大匹配 匈牙利算法 输入二分图 输出最大匹配-Hungary, seeking maximum matching algorithm input bipartite graph maximum matching output
bipmatch
- This source code solves the matching problem in bipartite graphs by implementing the Hungarian Algorithm.
Bin_match
- 二分图匹配的匈牙利算法。适用于各类二分图情景。-Hungary bipartite graph matching algorithm. Bipartite graph for all kinds of scenarios.
Bipartite-graph-matching-problem)
- 关于二分图中一些定义，定理及如何求解最大流的问题-Bipartite graph on some definitions, theorems and how to solve the problem of maximum flow
CVPR12_SAS_code
- 2012 CVPR 文章：Segmentation Using Superpixels A Bipartite Graph Partitioning Approach对应的代码-2012 CVPR paper：Segmentation Using Superpixels A Bipartite Graph Partitioning Approach
1469
- poj 1469 COURSES二分图的最大匹配问题 -poj 1469 COURSES largest bipartite graph matching problem
2771
- poj 2771一道关于二分图的最大匹配-poj 2771 on the maximum bipartite graph matching
kmMatch
- KM算法，实现二分图的最优匹配。可实现最大匹配或者最小匹配。-KM algorithm, bipartite graph to achieve the optimal match. Can achieve maximum or minimum match to match.
km
- 完全二分图算法（KM算法）的网络流算法实现，利用最小费用最大网络流算法-Complete bipartite graph algorithms (KM algorithm) network flow algorithm, using the minimum cost maximum network flow algorithm