搜索资源列表
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 匈牙利算法
AssignmentProblem
- 指派问题的匈牙利算法，用C语言编写，效果良好-Assignment Problem Soving
hungrian
- 匈牙利算法的源代码，可以解决二分图的最大匹配问题-Hungarian algorithm source code, can solve the maximum matching problem for bipartite graphs
Hxylu
- 匈牙利算法的实现，比较简单，本本人自己写，望大家赐教 -Hungary algorithm is relatively simple, the I write, we hope to enlighten
hungarian-v2.0
- 匈牙利算法，用来解决二部图分配问题。可以运行-Hungarian algorithm is used to solve the the two Figure allocation problem. Can run
1
- 匈牙利算法-Hungarian algorithm
ACM.algorithm
- 各种算法模板（二分图最大匹配匈牙利算法、最小生成树prime和kruskal算法、Dijkstra算法、两点最短路径负权值边SPFA算法、图任意两点最短路径Floy算法、网络最大流SAP算法、网络最大流最小费用算法、乘法逆元gcd扩展求解算法、线段树区间划分统计算法、矩阵n次方分治法求解、gcd算法、整数划分问题、函数最小点问题、十进制转ACM算法、素数筛选法和欧拉函数求解、快模算法、字符串匹配KMP算法、字典全排列算法、快排、三维度排序、）-Various algorithms templat
Hungarian_algorithm
- 这段代码使用matlab实现匈牙利算法的匹配问题-This algorithm allows you to find the minimum weight matching of a bipartite graph. The graph can be of arbitrary size and connectedness. The edge weights are captured by a MxN weight matrix where an infinite(Inf) weight desi
WindowsFormsApplication1
- C#代码，实现经典匈牙利算法，随机生成权值，自动寻找最优分配结果-C# code to achieve the classic Hungarian algorithm, randomly generated weights automatically find the optimal allocation results
uva-10349
- 二部图的最大匹配问题，先构建二部图，然后用匈牙利算法求出最大匹配-The maximum bipartite graph matching problem, first build a bipartite graph, and then use the Hungarian algorithm to derive maximum matching
fp
- 指派问题的匈牙利算法，基本算法实现。 Hungarian algorithm for assignment problem(Hungarian algorithm for assignment problem)
hungarian
- 匈牙利算法实现任务分配，源码详细编程，例子验证(Hungarian algorithm to achieve the task allocation, the source code detailed programming, examples of verification)
X
- 求解婚姻匹配模型时会遇到两匹配矩阵不为相等人数的情况，本程序可改善该点。利用匈牙利算法求解满足整体最优匹配的结果。(When solving a marriage matching model, it is possible to improve the point when the two matching matrix is not equal to the number of people. The Hungarian algorithm is used to solve the whol
图论算法及其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
粒子群算法求解机器人路径规划
- 无人机进行任务分配，采用匈牙利算法，原作者位于github(The drone uses the Hungarian algorithm for task assignment, the original author is located on github)