搜索资源列表
AhoCorasick.tar
- 本源码是AhoCorasick算法实现,它充分利用了词典算法双数组(DoubleArray Trie),既能自己输入指定的多个词进行多模式匹配,也可以将具有指定格式的词典的所有词作为多模式匹配的多个模式-The source code is AhoCorasick algorithm, which make full use of the dictionary algorithm pairs of arrays (DoubleArray Trie), both enter the designa
TireTree
- Trie树,又称字典树、单词查找树,是一种树形结构,用于保存大量的字符串。它的优点是:利用字符串的公共前缀来节约存储空间,是一种比较简单的数据结构。理解起来比较简单,但Trie树也有它的缺点,Trie树的内存消耗非常大。-Trie tree, also known as a dictionary tree, word search tree is a tree structure used to save a lot of strings. Its advantages are: the use
sftrie_src
- Shortest Common Superstring Problem by using suffix trie and branch-and-bound. This code is from Shin, YoungJin, Korea
trietreeJava
- trie的原理是利用字符串集合中字符串的公共前缀来降低时间开销以达到提高效率的目的。 它具有以下性质:1,根结点不包含任何字符信息 2,如果字符的种数为n,则每个结点的出度为n(这样必然会导致浪费很多空间,这也是trie的缺点,我还没有想到好点的办法避免) 3,查找,插入复杂度为O(n),n为字符串长度。-The principle is the use of a string trie collection of string prefix to reduce the time overh
mmtrie
- 写这个的出发点是吧之前做的trie能写到文件而且能很容易mmap到内存, 可以用于输入法 搜索引擎分词 词表的功能, 共享前缀存储, 支持最大20亿节点. 简单一点可以当一个hash表使用, 查找的时间复杂度为 N* Log(256) N为字符长度, key可以为二进制的数据, value 必须为int类型, 不能为0, 因为mmtrie_get()/find() 没有结果的情况下为0, 如果需要set value为0的话自己+1, 出来的时候-1就好了.-Write the start
dictionary
- 利用Trie树实现一个英语单词辅助记忆系统,完成相应的建表和查表程序-Trie tree using an English word to achieve auxiliary memory system, complete the appropriate procedures for the construction table and look-up table
Trie
- Trie,又称单词查找树、前缀树,是一种哈希树的变种。应用于字符串的统计与排序,经常被搜索引擎系统用于文本词频统计-Trie, also known as the word search tree, the prefix tree, is a variant of the hash tree. Applied statistics and sorting of strings, often by the search engine system for text word frequency s
HASH(Trie)-
- hash trie树 字典树,完整的sdk开发包 具有说明文档-hash trie tree dictionary tree, the complete development kit with documentation sdk
trie
- 自己实现的trie树结构,能够较为高效实现数据的各种查询操作-Own implementation of trie tree structure, to a variety of more efficient data queries
trie
- N-trie树 实现字典树,可以从TXT文件中读取数据-N-trie tree to achieve the dictionary tree, you can read data from a TXT file
trie-tree
- Trie是一种树型数据结构,用于存储字符串,可以实现字符串的快速查找。Trie的核心思想是空间换时间,利用字符串的公共前缀来降低查询时间的开销以达到提高效率的目的。 适用范围:统计和排序大量的字符串-Trie is a tree data structure used to store the string, the string can quickly find. Trie' s core idea is space for time, use the string prefix t
trie
- program to implement a trie and find longest path length, No:of nodes in the trie, Average length of the set of words in the trie, Average no:of nodes per word in the trie etc
Compressed Suffix Trie
- 构造compressed suffix trie class,并且实现findString()和findLongestCommonSubsequence()功能-implement the compact representation of the compressed suffix trie ADT for DNA analyses.
Trie
- 本程序实现了后缀树,即trie树。trie在字符串处理中有很重要的作用-This program implements suffix tree, ie trie tree. trie has a very important role in the string processing
trie
- 简单实现trie树,这里的删除没有用到其它的数据结构诸如堆栈,而是利用另外的指针存储路径来删除,详见代码和注释。-Simple implementation of trie tree, where the deletion is not used other data structures such as stacks, but to use a pointer to another storage path to delete, see the code and comments.
trie
- c++实现的一个trie树,可以实现插入、查找和遍历打印。-c++ implementation of a trie tree, you can achieve insert, search and traversal printing.
Trie
- 用字典树的方法高效地对英文文章的单词进行词频统计,并输出统计结果(词频由小到大)-To count the word frequency for an english artical efficiently, using the algorithm of trie, and output the statistic result(word frequency from low to high)
Trie
- 用Trie树实现的一个对字符串的统计和前缀匹配的功能-Trie tree with a realization of the statistics and prefix string matching functionsTrie tree with a realization of the statistics and prefix string matching functions
gw_Disjoint-Set-DFA-Trie
- 2014年北京大学暑假公开课算法讲解课件之并查集,DFA,Trie图,讲解详细,分析透彻-2014 Peking University summer open class courseware on the algorithm and check collection, DFA, Trie, explain the detailed, thorough analysis
trie
- trie 树实现 输入 输入的第一行为一个正整数n,表示词典的大小,其后n行,每一行一个单词(不保证是英文单词,也有可能是火星文单词哦),单词由不超过10个的小写英文字母组成,可能存在相同的单词,此时应将其视作不同的单词。接下来的一行为一个正整数m,表示小Hi询问的次数,其后m行,每一行一个字符串,该字符串由不超过10个的小写英文字母组成,表示小Hi的一个询问。 在20 的数据中n, m< 10,词典的字母表大小< 2. 在60 的数据中n, m<