搜索资源列表
匈牙利
- vb环境下 匈牙利算法的解决 自己编的 仅供参考-Hungary Algorathm in vb,made by myself ,just for reference
匈牙利法
- 匈牙利法解决分派问题，你遇到过分派问题吗？-assigned to Hungary and France to resolve the problem, you have to have too much to send?
hungary algorithm
- 学习该算法的可以借鉴一下！
匈牙利算法
- 本文用Ｃ语言实现了优化算法－匈牙利算法，以用来解决匹配问题-Using C programming language, the optimization algorithm-Hungary algorithm used to solve the matching problem
hungry
- 用匈牙利算法解决二部图的最优匹配问题,可用于多任务的指派问题的解决.-Hungary algorithm used to solve the two plans optimal matching can be used for many tasks assigned to resolve the problem.
HungarySolution
- Hungary Solution 匈牙利算法的MATLAB程序（用以解决分配（指派）问题）-Hungary Hungary Solution Algorithm MATLAB program (to resolve the allocation (assignment) problems)
Hungary
- 匈牙利算法实现二分图最大匹配 文件输入输出.-Hungarian algorithm bipartite graph maximum matching document input and output.
1011423523562
- 有关统计学的运筹学之指派问题的匈牙利算法。-Operational research on the statistics of the assignment problem of Hungary algorithm.
hungury
- 用编程来实现匈牙利算法，主要解决指派问题，有兴趣的下来看看。-Hungary used to achieve programming algorithm, mainly to solve the assignment problem, interested to see it.
vc1011423523562
- 匈牙利算法 解决类似于线性规划中的分配问题,用于各种匹配算法-Hungary is similar to linear programming algorithm to solve the distribution problem, for a variety of matching algorithm
xiongyaliandKMsuanfa
- 匈牙利算法和KM算法 详细讲解了匈牙利算法和KM算法 及其实现-Hungary and the KM Algorithm algorithm detailed account of the Hungarian algorithm and the KM Algorithm and Its Implementation
Hungary
- 匈牙利算法 C# vs2005 匈牙利算法-Hungarian algorithm C# vs2005 匈牙利算法
hungary
- 求最大匹配 匈牙利算法 输入二分图 输出最大匹配-Hungary, seeking maximum matching algorithm input bipartite graph maximum matching output
Hungary-Algorithm
- 匈牙利算法,包括目录/问题简介/算法描述/时间空间复杂度/样例程序等. -hungury algorithm
Hungary-algorithm
- 用来求解指派问题的匈牙利算法，比目前网上流传的运行效果都好。-Hungary algorithm
Hungary
- 二部图的最大匹配的一种算法：匈牙利算法的matlab程序-Two parts graph the maximal matching of a kind of algorithm: Hungary algorithm
Hungary-Algorithm
- 二分图最大匹配算法JAVA实现,使用匈牙利算法,eclipse环境-Hungary Algorithm
Hungary-algorithm-
- 利用增广路径，求二部图的最大匹配的匈牙利算法-The Hungary maximum matching algorithm of Bipartite graph.
Hungary-algorithm
- “匈牙利算法”可以用于求解多种形式的指派 问题,其基本思想是寻找独立1元素组,而独立1 元素组与图论中对集是一个等价概念,所以与图论中求解赋权二分图最优对集、最大对集的思想是一脉相承的。 -Hungary algorithm
hungary
- 二分图最大匹配,hungary算法,邻接阵形式,复杂度O(m*m*n)-Bipartite graph maximum matching, hungary algorithm, adjacency matrix form, complexity O (m* m* n)