搜索资源列表
xiongyali
- 匈牙利算法,求解二分图最大匹配的一个时间复杂度与程序复杂度折中的算法-Hungary algorithm to solve the greatest two minutes map matching a time complexity and the complexity of program compromise Algorithm
zhipaiwenti
- 运筹学之指派问题的匈牙利算法。刚刚才看到的，不错哦-tacticians Zhi assignment of the Hungarian algorithm. Only just to see, oh well
AnyMap_Match
- 任意图的最大匹配算法，值得一学。毕竟各位不是只要会会匈牙利算法的那种人吧？-arbitrary map of the maximum matching algorithm, it is worth a study. After all, you would not say that the kind of Hungary algorithm people? Ha ha
Bipartite
- 图论*匈牙利算法 的两种实现过程 Matching的巧妙在于队列的进入退出并没有仅仅限于在同一层循环中做到，构思巧妙 其算法思想在《算法设计与分析基础》上可以参阅-Graph theory* Two Hungarian Algorithm realization process ingenious Matching queue entry and exit is not just limited to the same level as the cycle done, the idea
src
- PKU中一些数据结构基本算法题的java实现，包括DIJ、PRIM、二叉查找树、并查集、动态规划、KMP、匈牙利算法、深搜广搜等-PKU some basic data structure algorithm java realization of the title, including DIJ, PRIM, binary search tree, and search sets, dynamic programming, KMP, the Hungarian algorithm, colle
Hungary
- 匈牙利算法实现二分图最大匹配 文件输入输出.-Hungarian algorithm bipartite graph maximum matching document input and output.
vc1011423523562
- 匈牙利算法 解决类似于线性规划中的分配问题,用于各种匹配算法-Hungary is similar to linear programming algorithm to solve the distribution problem, for a variety of matching algorithm
acm-pku1466
- 二分图的最大匹配之匈牙利算法详解，以前做ACM时写的，仅供参考，另外提供了一个北大题目的源程序作为实现实例-data structure--graph
HungaryAlgorithm
- 匈牙利算法，实现求二分图最大匹配，还有一些资料，实现的语言是C-Hungarian algorithm, seeking to achieve the maximum bipartite matching, there are some data to realize the language is C++
munkres-v2
- 匈牙利算法介绍文档及实现程序，C++语言，非常好用。-Huangary Algorithm。
C_Programming_Assignment_Problem_Hungarian_algorit
- C编程设计指派问题匈牙利算法C Programming Assignment Problem Hungarian algorithm-C Programming Assignment Problem Hungarian algorithm
xiongyalisuanfa
- 匈牙利算法是求解指派问题的多项式时间算法
suanfa
- 匈牙利算法以及指派问题介绍，kM算法和匈牙利算法的程序代码-Hungarian algorithm and the assignment problem introduced, kM algorithm and the Hungarian algorithm code
graph-algorithm
- 图论算法，包括最短路算法、最小生成树、图的连通性、网络流、匈牙利算法等等源码-graph algorithm
xyl
- 匈牙利算法，实现二分图问题的好途径，自己写的，是用邻接表来实现。-Hungarian algorithm for bipartite graph a good way to write your own adjacency list.
munkres
- 匈牙利算法matlab实现，对于二部图的最优匹配-Hungarian algorithm matlab achieve optimal matching of bipartite graph
KM
- N阶方阵不同行不同列最优权值，利用KM算法结合匈牙利算法，代码配有我的理解与注释，便于观看学习。-KM Algorithm and The Hungarian algorithm.
Hungary-algorithm-
- 利用增广路径，求二部图的最大匹配的匈牙利算法-The Hungary maximum matching algorithm of Bipartite graph.
scrolm_constrartor_draw
- 匈牙利算法求解最优分配问题,是windows环境下的哦！()