搜索资源列表
trietree
- trie tree, 是一个高效处理字符串的比较常见的算法,能够让我们在复杂度 O(log(n))的情况下插入和查询一个字符串
darts-0.32.tar
- double array trie的实现，是从国外的网站下载的
libdatrie_0.1.2.orig.tar
- Double Array Trie 的实现
T9pingjinshurufa
- 手机的T9拼音输入法,用C写的,里面有词表,trie树-Phone T9 Pinyin input method, written with C, which has the word table, trie tree
EasyTrie
- c#实现trie树 可以用来建立索引 实现时每个节点的子节点数组用list来替代,减少了空间的需求-The implementation for a trie. You can use it to build your index.
trie
- trie字典树 字典树C语言实现的算法。-trie dictionary tree C language implementation of the algorithm.
zidianshu
- 字典树（Trie）是一种用于快速字符串检索的多叉树结构。其原理是利用字符串的公共前缀来降低时空开销,从而达到提高程序效率的目的。-Dictionary tree (Trie) is a string to search for rapid multi-branch tree structure. The principle is to use the string prefix to reduce the time and space for public spending so as to i
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
TrieTree
- 一般trie（特里）树的实现例子，这里的trie树反映了一定的设计思路，但实际工程中须优化，如使用双数组的trie树。-General trie (Terry) the realization of the tree example, where the trie tree certainly reflect a degree of design ideas, but the actual project to be optimized, such as the use of dual-arra
AC-Automation
- AC自动机算法 多模匹配算法 构造TRIE+构造失败指针+匹配-ac automation algorithm
TrieTrees
- It s an interface for using Trie Trees (data structure application) (used for implementing optimal sets...with applications on text data as input...foe example dictionaries) and a test program with CLI in a form of a menu to test those features.
trie
- This program implements a (zipped) tree search for information retrieval programs, first you can get a key words and then it will save them in its format. also with a simple change you can pass a file as input and find related document information. i
acmcontesttemplate
- Bfs，Dijstara，Floyd，Kruskal，Prim，并查集，网络流，Trie等acm竞赛模板-Bfs Dijstara Floyd Kruskal Prim and the set of network flow Trie search such acm contest template
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
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
AC-automation
- 建立AC自动机，实现快速字符串匹配的模板。 高效建立trie，并且构造fail指针。 在敏感词过滤和杀毒方面有广泛应用-AC automatic machine set up, fast string matching template. Efficient establishment of trie, and the structure fail pointer. In the sensitive word filtering and anti-virus has a wi
Tightly-Packed-Tries
- Tightly Packed Tries: How to Fit Large Models into Memory, and Make them Load Fast, Too We present Tightly Packed Tries (TPTs), a compact implementation of read-only, compressed trie structures with fast on-demand paging and short load times. We de
cprops
- The cprops (C prototyping tools) library provides a portable, thread-safe C API including linked list, binary heap, priority queue, hash table, hash list, trie, AVL, Red-Black, and splay tree implementations, a thread pool and thread management fra
adarrts-02tarr
- 双数组辞典生成程序源码。运用双数组实现trie算法，对于不定长度共同前前缀查询情况，比哈希方法更为有效。经常用于分词辞典的制作。 可直接使用。 -The dual array thesaurus program source code is generated. The use of double-array trie algorithm for indefinite length common prefix query before, Bi Haxi method is more effe
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)