当前位置：
首页 资源下载
搜索资源 - hungarian algorithm
搜索资源列表
-
0下载：
图论算法及其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
-
-
0下载：
图论*匈牙利算法 的两种实现过程
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
-
-
0下载：
匈牙利算法实现二分图最大匹配
文件输入输出.-Hungarian algorithm bipartite graph maximum matching document input and output.
-
-
0下载：
用C语言编写的匈牙利算法,程序较长，可以运行。-Using C language prepare the Hungarian algorithm, the program longer, you can run.
-
-
0下载：
匈牙利算法和KM算法 详细讲解了匈牙利算法和KM算法 及其实现-Hungary and the KM Algorithm algorithm detailed account of the Hungarian algorithm and the KM Algorithm and Its Implementation
-
-
0下载：
最速下降法，搜索算法，匈牙利算法。-Steepest descent method, the search algorithm, the Hungarian algorithm. Etc.
-
-
0下载：
hungarian algorithm implemented in java
-
-
1下载：
匈牙利算法。可解决指派问题，匹配问题，覆盖问题等。-Hungarian algorithm. Solve the assignment problem, matching, covering problems.
-
-
0下载：
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
-
-
0下载：
匈牙利算法 求解最大匹配问题 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
-
-
0下载：
匈牙利算法的MatLab实现，用于求解关于最大连接-MatLab implementation of the Hungarian algorithm for solving the maximum connection on
-
-
0下载：
求解指派问题（N个人完成M项工作）的匈牙利算法，使用C++描述，VC6.0-Solving assignment problem (N individual items of work completed M) Hungarian algorithm using C++ descr iption, VC6.0
-
-
0下载：
这是一个可行的匈牙利算法，是一个基本程序，也可以嵌入到大程序中，对初学者和使用者都是不错的参考。-This is a executable Hungarian algorithm .You can embed it in your program and you can learn it clearly.
-
-
0下载：
函数查找最小边的权重匹配给出的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
-
-
0下载：
匈牙利算法是基于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
-
-
0下载：
忘记在哪下的了，是匈牙利算法。可以非常好的运行，做运筹学课设时可以借鉴。-Hungarian algorithm
-
-
1下载：
用匈牙利算法求求解二分图最大匹配的算法思路-An algorithm for finding the maximum matching of two points graph with Hungarian algorithm
-
-
0下载：
matlab program for hungarian algorithm to find the maximum maching
-
-
0下载：
本程序主要是通过匈牙利算法实现匹配，用于MATLAB仿真；(Matching by Hungarian algorithm;)
-
-
0下载：
对异构网络下的信道环境进行建模，包括路径损耗，多径衰落效应，小尺度衰落，并给出了匈牙利算法的实现(Modeling the channel environment under heterogeneous networks, including path loss, multipath fading effect, small-scale fading, and giving the implementation of Hungarian algorithm)
-
