搜索资源列表
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
zz
- 用C语言编写的匈牙利算法,程序较长，可以运行。-Using C language prepare the Hungarian algorithm, the program longer, you can run.
Hungarian
- 这是一个匈牙利算法，非常有用，对于解决二次分配有帮助。-this code id designed for quasi-assignment, and it maybe helpful for some optimization problem.
MATLAB
- 最速下降法，搜索算法，匈牙利算法。-Steepest descent method, the search algorithm, the Hungarian algorithm. Etc.
Hungarian
- 匈牙利算法。可解决指派问题，匹配问题，覆盖问题等。-Hungarian algorithm. Solve the assignment problem, matching, covering problems.
bipmatch
- This source code solves the matching problem in bipartite graphs by implementing the Hungarian Algorithm.
Hungarian
- This source code is one version of Hungarian Algorithm used in bipartite graphs. For more information please refer to source codes.-This source code is one version of Hungarian Algorithm used in bipartite graphs. For more information please refer to
assignmentoptimal
- 解最优化问题的算法，用于解决最大后验概率问题，主要应用于目标跟踪中。-Hungarian algorithm for solving maximum a posteriori probability, is mainly used in target tracking.
hungarian
- 匈牙利算法 求解最大匹配问题 s为最佳匹配的总权值 e(:,[1,2])为匹配的两点，e(:,3)为各匹配的权-Hungarian algorithm to solve the maximum matching problem s is the best match of the total weight e (:, [1,2]) to match the two points, e (:, 3) for the right match
Hungarian-algorithm
- 匈牙利算法的MatLab实现，用于求解关于最大连接-MatLab implementation of the Hungarian algorithm for solving the maximum connection on
Hungarian
- 匈牙利演算法 解決對稱或不對稱matching問題-Hungarian Algorithm
hungarian-v2.0
- 匈牙利算法，用来解决二部图分配问题。可以运行-Hungarian algorithm is used to solve the the two Figure allocation problem. Can run
hungarian
- 该算法是自己编写的匈牙利算法，该算法的计算速度要比传统算法快一倍-The algorithm is written in Hungarian own algorithm to calculate the speed of the algorithm is twice as fast than the traditional algorithm
Hungarian-algorithm
- 求解指派问题（N个人完成M项工作）的匈牙利算法，使用C++描述，VC6.0-Solving assignment problem (N individual items of work completed M) Hungarian algorithm using C++ descr iption, VC6.0
Hungarian-algorithm
- 这是一个可行的匈牙利算法，是一个基本程序，也可以嵌入到大程序中，对初学者和使用者都是不错的参考。-This is a executable Hungarian algorithm .You can embed it in your program and you can learn it clearly.
Hungarian
- 匈牙利算法的matlab程序，用于解决最大匹配等问题-Hungarian algorithm matlab program for solving the maximum matching problem
Hungarian
- 匈牙利算法，matlba源文件，可以直接运行，输入参数是两个向量-Hungarian Algorithm
Hungarian-Algorithm.
- 函数查找最小边的权重匹配给出的M×N的边缘 使用匈牙利算法权重矩阵的权重 A function for finding a minimum edge weight matching given a MxN Edge weight matrix WEIGHTS using the Hungarian Algorithm. - A function for finding a minimum edge weight matching given a MxN Edge we
Hungarian-algorithm
- 匈牙利算法是基于Hall定理中充分性证明的思想，它是部图匹配最常见的算法，该算法的核心就是寻找增-Hungarian algorithm is based on sufficient proof of the theorem Hall of thought, it is the most common graphs matching algorithm, the core of the algorithm is to find a
Hungarian
- 本程序主要是通过匈牙利算法实现匹配，用于MATLAB仿真；(Matching by Hungarian algorithm;)