当前位置：
首页 资源下载
搜索资源 - hungarian matching
搜索资源列表
-
0下载：
Matching methods such as the Hungarian algorithm have recently made an appearance as an alternative to classical tracking algorithms in computer vision, since they are able to nd the set of tracks that optimizes well-dened criteria over a given vid
-
-
0下载：
KM算法，二分图匹配算法，匈牙利算法，给定加权矩阵，计算匹配策略-KM algorithm, bipartite graph matching algorithm, the Hungarian algorithm, for a given weight matrix to calculate matching strategy
-
-
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下载：
这一代码应用最经典的二部图算法，稍加改动便可用于其它类似题目，希望有所帮助-The code of the most classic bipartite graph algorithm can be modified for other similar topic, hope that help
-
-
0下载：
三种二项图最大匹配算法.包括使用广度优先搜索以及深度优先搜索的匈牙利算法，以及Hopcroft-Karp算法。-Three of bipartite graph maximum matching algorithms. Including
1.Hungarian with DFS
2.Hungarian with BFS
3.Hopcroft-Karp algorithm
-
-
1下载：
匈牙利算法，实现求二分图最大匹配，还有一些资料，实现的语言是C-Hungarian algorithm, seeking to achieve the maximum bipartite matching, there are some data to realize the language is C++
-
-
1下载：
匈牙利算法。可解决指派问题，匹配问题，覆盖问题等。-Hungarian algorithm. Solve the assignment problem, matching, covering problems.
-
-
0下载：
This source code solves the matching problem in bipartite graphs by implementing the Hungarian Algorithm.
-
-
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下载：
匈牙利演算法 解決對稱或不對稱matching問題-Hungarian Algorithm
-
-
0下载：
都是自己实现的代码 自认为代码较同类短 实现清晰 效率很高 故传上来分享
HLPP 最高标号预留推进 网络流最好算法之一
DynamicTree 动态树 树上维护数据的终极算法
SAM 后缀自动机 多模式串线性处理 例题:CTSC2012 熟悉的文章
最后匈牙利 匹配算法-Code are realized since that clear and efficient code than similar short it pass up sharing the the HLPP
-
-
0下载：
匈牙利匹配算法,利用匈牙利匹配算法，解决图论中的最大匹配问题，-Hungarian matching algorithm using Hungarian matching algorithm to solve the maximum matching problem in graph theory,
-
-
0下载：
自己的笔记，二分图匹配详解，是用匈牙利算法解的。-Own notes, bipartite graph matching explain, with the Hungarian algorithm solution.
-
-
0下载：
匈牙利算法的matlab程序，用于解决最大匹配等问题-Hungarian algorithm matlab program for solving the maximum matching problem
-
-
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
-
-
1下载：
用匈牙利算法求求解二分图最大匹配的算法思路-An algorithm for finding the maximum matching of two points graph with Hungarian algorithm
-
-
0下载：
本程序主要是通过匈牙利算法实现匹配，用于MATLAB仿真；(Matching by Hungarian algorithm;)
-
