搜索资源列表
hgr
- 求二分图最大匹配 匈牙利算法-Seeking the maximum bipartite graph matching for bipartite graph maximum matching algorithm Hungary
hungary
- 求最大匹配 匈牙利算法 输入二分图 输出最大匹配-Hungary, seeking maximum matching algorithm input bipartite graph maximum matching output
Bin_match
- 二分图匹配的匈牙利算法。适用于各类二分图情景。-Hungary bipartite graph matching algorithm. Bipartite graph for all kinds of scenarios.
MATLAB-algorithm-and-program-code
- 图论算法及matlab程序代码包含求任两点间最短路径的算法及代码Floyd、kruskal，最大匹配的匈牙利算法，并使用matlab程序实现。-Graph algorithms and matlab code includes the algorithm(Floyd, kruskal, maximal matching algorithm of Hungary,) to solve the shortest path between two points, and use matlab prog
Algorithm-template
- C++ 写的一些算法模板 ，比如Kruskal、KMP、欧几里德算法、最大匹配(匈牙利算法)、最小费用最大流、字符串的哈希方法、增广路算法、网络最大流_邻接表等-C++ write some algorithms template, such as Kruskal, KMP, Euclid arithmetic, maximal matching (Hungary) is proposed, the minimum cost and maximum flow, string hash metho