搜索资源列表
hungry
- 用匈牙利算法解决二部图的最优匹配问题,可用于多任务的指派问题的解决.-Hungary algorithm used to solve the two plans optimal matching can be used for many tasks assigned to resolve the problem.
hungary algorithm
- 学习该算法的可以借鉴一下！
matlab
- floyd最短路算法&求网络的最小费用最大流&匈牙利算法&求网络的最小费用最大流-Floyd s short for network algorithm and the minimum cost flow and Hungary algorithm for the minimum cost and maximum flow network
Hungary01
- 匈牙利算法 c#源码 实现匈牙利最优匹配-Hungarian algorithm c# source ,achieve Hungary optimal match
hungury
- 用编程来实现匈牙利算法，主要解决指派问题，有兴趣的下来看看。-Hungary used to achieve programming algorithm, mainly to solve the assignment problem, interested to see it.
Hungary
- 匈牙利算法 C# vs2005 匈牙利算法-Hungarian algorithm C# vs2005 匈牙利算法
Hxylu
- 匈牙利算法的实现，比较简单，本本人自己写，望大家赐教 -Hungary algorithm is relatively simple, the I write, we hope to enlighten
Pets_BFS
- 匹配问题 - 匈牙利树算法 - 广度优先搜索BFS-Match- Hungary tree algorithm- breadth-first search BFS
Hungary
- 匈牙利算法求解指派问题，能够求解大规模的指派问题，经过不同规模问题的测试均无问题。-Hungarian algorithm for assignment problem that can be assigned to solve large-scale problems, the scale of the problem through different tests no problem.
hungary
- 二分图最大匹配,hungary算法,邻接阵形式,复杂度O(m*m*n)-Bipartite graph maximum matching, hungary algorithm, adjacency matrix form, complexity O (m* m* n)
图论算法及其MATLAB程序代码
- 常用图论算法及其MATLAB程序代码： 1.最短路的Warshall-Floyd算法 2.最小生成树Kruskal避圈法 3.二部图G的最大匹配的算法(匈牙利算法)(The commonly used graph theory algorithm and its MATLAB program code: 1. shortest path Warshall-Floyd algorithm 2. minimum spanning tree Kruskal avoidance meth
C
- KM算法可以计算二分图的最大权匹配，匈牙利算法可以计算最大匹配(KM algorithm can calculate the maximum weight matching of bipartite graphs, Hungary algorithm can calculate the maximum matching.)