搜索资源列表
biMatichHungary
- 偶图最大匹配完全照算法说明利用集合运算实现的matlab代码。这里需要大家讨论的是增广路的选取的算法,希望朋友们多多讨论,争取找一种更好的增广路方法,有想法的一定告诉我,谢谢,jxrhhu@hhu.edu.cn-Bipartite graph maximum matching algorithm descr iption completely according to the use of computing to achieve a collection of matlab code. Her
Hungary
- 匈牙利算法实现二分图最大匹配 文件输入输出.-Hungarian algorithm bipartite graph maximum matching document input and output.
hungray
- 二分图匹配-匈牙利算法 效率很高,求二分图最大匹配。-Bipartite graph matching- Hungary algorithm highly efficient, and the maximum bipartite graph matching.
ir
- 本系统实现了分词和倒排索引,分词采用正向最大匹配,-The system achieved a sub-word and the inverted index, the biggest being the use of sub-word match,
TEMPLATE
- 输入正则表达式,转化为NFA,DFA,从测试文档中找出最大匹配子串-Enter the regular expression into NFA, DFA, document from the test to find out the biggest match Substring
hgr
- 求二分图最大匹配 匈牙利算法-Seeking the maximum bipartite graph matching for bipartite graph maximum matching algorithm Hungary
ParseWord
- 利用字典进行文章分词,正向最大匹配,你想最大匹配,并包含一个词汇表,vs 2005, c#-parse word, vs2005, c#
delphiautodown
- 很好的东东,大家顶顶,向前匹配加向后最大匹配,C#开发,容易扩展-Dongdong good, everyone顶顶forward matching add backward maximum matching, C# development, easily extended
Matching_on_Weighted_Bipartite_Graph
- 加权二分图匹配,对于给定权重的二分图求出最大匹配-find the max matching of a given weighted bipartite graph
crosscorrelation
- 基于最大互相关的图像匹配,是本人的毕业设计,希望对大家有帮助。-The largest cross-correlation-based image matching, is my graduation project, I hope there is help for everyone.
SomeProgramForDataStructure
- KMP字符串匹配的c实现,测试字符串为char a[20]="abcdefghijk" char b[20]="abcdefgg" 取各位数字的算法,最大有效测试数据长整形最N=100000000 贪婪算法:已知若干面值的人名币,如何找零钱,使张数最小,测试面值a[4]={25,10,5,1} 快速排序C++实现-KMP string matching c to achieve the test string to char a [20] = " abcdefghijk"
MaxMatching
- 寻找两个已知二项图之间的最大匹配, 用图的邻接表表示, 组合数学作业-Two diagrams to find the best match between
2771
- poj 2771 一道关于二分图的最大匹配-poj 2771 on the maximum bipartite graph matching
1469
- poj 1469 COURSES 二分图的最大匹配问题 -poj 1469 COURSES largest bipartite graph matching problem
fenci
- PHP 织梦逆向最大匹配算法 中文分词 分词算法-PHP DedeCms reverse maximum matching algorithm for Chinese word segmentation algorithm
KMP
- 给定两个串S和T,长分别m和n,算法给出了一个找出二串间最大匹配的算法。该算法可用于比较两个串S和T的相似程度。-Given two strings S and T, respectively m and n, an algorithm to find the second largest string matching algorithms. The algorithm can be used to compare two strings S and T the degree of simil
KSeg4J.1.0
- 简体中文机械分词模块,实现正逆向最大匹配消除歧义,jar封装,可以导入后直接使用-a simplified Chinese segmentation Jar
poj1469
- poj1469, 二分图最大匹配,最大匹配-poj1469, Maximum Bipartite Matching
zoj1525Airraid
- zoj1525, 最小路径覆盖, 最大匹配-zoj1525, minimum path cover
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