搜索资源列表
GraphTheoryAlgorithmMATLAB
- 图论算法及其MATLAB 程序代码 1.求赋权图G = (V, E , F )中任意两点间的最短路的Warshall-Floyd 算法、Kruskal 避圈法 2.求二部图G 的最大匹配的算法(匈牙利算法)、利用可行点标记求最佳匹配的算法 3.从一个可行流f 开始, 求最大流的Ford--Fulkerson 标号算法 6.-Graph Theory Algorithm and MATLAB program code 1. Seeking weighted graph G = (V
bpmpdmex2.21.1_linux_R2007.tar
- BPMPD_MEX is a Matlab MEX interface to BPMPD, an interior point solver for quadratic programming developed by Csaba Mészáros at the MTA SZTAKI, Computer and Automation Research Institute, Hungarian Academy of Sciences, Budapest, Hungary.
MATLAB
- 最速下降法，搜索算法，匈牙利算法。-Steepest descent method, the search algorithm, the Hungarian algorithm. Etc.
Hungarian
- 匈牙利算法。可解决指派问题，匹配问题，覆盖问题等。-Hungarian algorithm. Solve the assignment problem, matching, covering problems.
asic3
- This pdf contains Hungarian notifications and asic methodologies .
algorithm-of-xiongyali
- 该文件给出了图论中最短路径的算法程序，其算法使用匈牙利算法-The document gives the shortest path in graph theory algorithm program, the algorithm uses the Hungarian algorithm
assignmentoptimal
- 解最优化问题的算法，用于解决最大后验概率问题，主要应用于目标跟踪中。-Hungarian algorithm for solving maximum a posteriori probability, is mainly used in target tracking.
Graph-algorithms
- 图论算法。图论算法在计算机科学中扮演着很重要的角色，它提供了对很多问题都有效的一种简单而系统的建模方式。很多问题都可以转化为图论问题，然后用图论的基本算法加以解决。本资料包含了Floyd、prim、匈牙利算法等算法-Graph algorithms. Graph algorithms in computer science plays a very important role, it provides a lot of problems for a simple and effective w
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
xiongyali
- matlab 匈牙利算法，百度搜到的，试了可以用-Hungarian algorithm matlab
hungcode
- matlab code for hungarian code in matrix format solves channel assignment problems
xiongyalisuanfa
- 针对匈牙利算法，用matlab实现的匈牙利算法的程序！-Hungarian Algorithm
zuidapipei
- 使用匈牙利算法实现二部图最大匹配，最终找到二部图的最大匹配-achieve the max matching in bipartite graph useing the method of Hungarian algorithm
Hopcroft_Karp
- 用于复杂网络中二分图的几种算法，包括著名的匈牙利算法等-For complex network of binary chart in several kinds of algorithm, including the famous Hungarian algorithm, etc
MatlabGr
- 图论程序包，包括最短路的两种算法、最小生成树、匈牙利算法和哈密顿问题的智能算法。-Graph Theory package, including the shortest of the two algorithms, minimum spanning tree, the Hungarian algorithm and Hamiltonian problem intelligent algorithm.
Hungary
- Matlab程序，匈牙利算法，可用于指派问题的求解-Hungarian algorithm can be used to solve the assignment problem
munkres
- Hungarian algorithm - finds the closet permutation matrix to a target matrix.
maxhungarian
- matlab program for hungarian algorithm to find the maximum maching
Hungarian-algorithm-By-matlab-master
- 对异构网络下的信道环境进行建模，包括路径损耗，多径衰落效应，小尺度衰落，并给出了匈牙利算法的实现(Modeling the channel environment under heterogeneous networks, including path loss, multipath fading effect, small-scale fading, and giving the implementation of Hungarian algorithm)