搜索资源列表
smith.rar
- 用matlab实现单双枝节阻抗匹配，并用smith圆图匹配演示过程,Using matlab to achieve single-and double-side impedance matching, and demonstrate smith circle graph matching process
GraphAlgorithm.rar
- C++语言下, 关于图论算法的一些模版, 包括一般图最大匹配, km匹配, 最小割等等, 共15个模版,C++ language under the graph theory algorithm on a number of templates, including the maximum matching in general graph, km matching, minimum cut, etc., a total of 15 templates
EBGM123
- 经过自己修正后的弹性图匹配人脸认证算法，耗时比较长一点。-Amended after their elastic graph matching face authentication algorithm, a longer time-consuming.
graph
- 图论的算法，最短路，最小生成树，连通，匹配，网络流及应用。-Graph theory, algorithms, shortest path, minimum spanning tree, connectivity, matching, network flow and applications.
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
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
Hungary
- 匈牙利算法实现二分图最大匹配 文件输入输出.-Hungarian algorithm bipartite graph maximum matching document input and output.
hgr
- 求二分图最大匹配 匈牙利算法-Seeking the maximum bipartite graph matching for bipartite graph maximum matching algorithm Hungary
Matching_on_Weighted_Bipartite_Graph
- 加权二分图匹配，对于给定权重的二分图求出最大匹配-find the max matching of a given weighted bipartite graph
Maximum.matching.algorithm.in.general.graph.o(n^3
- A matching on a graph is a set of edges, no two of which share a vertex.
graph-match-PRL
- Text-independent speaker recognition using graph matching.
20090224171138551
- 主要内容： 匹配的概念 二分图的定义和判定 二分图的最大匹配 二分图的最小覆盖问题 二分图的最佳匹配问题 -Main elements: the concept of matching the definition of bipartite graph and determine the maximum bipartite graph matching bipartite graph of minimum coverage of bipartite graph match
graph_matching_SMAC
- Graph Matching Toolbox in Matlab tested on Matlab 7.4 (windows/mac/unix) fixed a bug which affected discretization performance in the case of different graph sizes
testpipei_1
- 基于灰度的归一化匹配算法：将原图以及匹配图灰度化，算出相关系数后得到匹配区域。-Based on Gray' s normalized matching algorithms: the original image and the gray level of matching graph, calculate the correlation coefficient obtained after the matching area.
General-graph-matching
- ACM竞赛中 一般图的最大匹配 带花树-ACM contest the general graph maximum matching with trees and flowers. . . .
Bipartite-graph-matching-template
- 求二分图匹配多种算法，网络流最大流的部分模板-Find a variety of bipartite graph matching algorithms, network flow part of the template maximum flow
Bipartite-graph-matching-problem)
- 关于二分图中一些定义，定理及如何求解最大流的问题-Bipartite graph on some definitions, theorems and how to solve the problem of maximum flow
graph
- 解决图匹配的二次规划问题，完成一对一的匹配-Solve quadratic programming graph matching problem, and to complete a one-to-one matching
Bipartite-graph-matching
- 自己的笔记，二分图匹配详解，是用匈牙利算法解的。-Own notes, bipartite graph matching explain, with the Hungarian algorithm solution.
matching
- 提供二分图匹配算法、带权二分图匹配算法、以及HopCroft优化的匹配算法-Provide two graph matching algorithm, weighted two graph matching algorithm, the matching algorithm and HopCroft optimization