搜索资源列表
libdatrie-0.2.4.tar
- 这是一个经典的通过双数组实现Trie树的示例-This is an implementation of double-array structure for representing trie, as proposed by Junichi Aoe
search
- trie搜索树模拟的服务器间搜索算法。需要在c:\ 创建1~10 10个文档，记录服务器内容。“1.txt”-trie search tree search algorithm for the simulation servers. Need to c: \ to create 1 to 10 of 10 documents, records server content. " 1.txt"
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
poj1816
- poj上1816题，用静态trie树这个数据结构实现-poj on the 1816 title, with the static trie tree data structure to achieve this
Proiect-ADS
- Algorithms and Data Structures Application for B and Trie combined trees
Course-design-English-dictionary
- Trie树通常作为一种索引树，这种结构对于大小变化很大的关键字特别有用。利用Trie树实现一个英语单词辅助记忆系统，完成相应的建表和查表程序。-Trie trees usually as a tree, the structure on the index of the key word size change a lot is especially useful. Use Trie tree realize one English word memory system, complete au
EngAssist
- 一个英文写作助手，具有单词纠错，补全等功能，利用Trie树实现-An English writing assistant, has the words the error correction, fill congruent function, use Trie tree realized
TrieImp
- Trie implementation in java
dictionarytree
- 又称单词查找树，Trie树，是一种树形结构，是一种哈希树的变种。典型应用是用于统计，排序和保存大量的字符串（但不仅限于字符串），所以经常被搜索引擎系统用于文本词频统计-Also known as word search tree, the trie is a tree structure, which is a variant of the hash tree. Typical applications are used for statistical, sort and save a lot
mian
- 又称单词查找树，Trie树，是一种树形结构，是一种哈希树的变种。典型应用是用于统计，排序和保存大量的字符串（但不仅限于字符串），所以经常被搜索引擎系统用于文本词频统计。它的优点是：利用字符串的公共前缀来节约存储空间，最大限度地减少无谓的字符串比较，查询效率比哈希表高。 -Text of obtaining statistics its advantage is: use the public to save string prefix storage space, the maximum r
NYOJ.290.DictionaryTree
- 字典树，Trie树，查找插入效率都很高的一种高级数据结构。-Dictionary tree, Trie, an advanced data structures to find the insertion efficiency high.
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
shudejianliyuchazhao
- Trie树构建与查找，文档包括程序思路详解与代码及注释，数据结构作业-Trie tree Find program ideas Detailed code and notes, data structure operations
ChineseSegmentation
- 用trie算法实现的中分分词程序，在VC2010中编译运行成功，所参考资料也为转载，若原作看到这个，希望与我联系：）-Chinese Segmentation implemented by Trie algorithm,compiling and running successfully in VC2010
TRIE
- 字典树的插入和查找，了解字典树的方便之处-The insertion Find of the dictionary tree
trie_QT_Code
- 基于trie树的词频统计工具，用QT开发界面-Frequency Statistics tool based on a trie, QT development interface
The-AVL-trie-of-word
- 实现用AVL树的数据结构和算法，进行单词的查找！-With realization of an AVL tree algorithm, carries on the word search!
CMST-DataStruct
- A Classifi ed Multi-Suffi x Trie for IP Lookup and Update
temp
- poj 2967 BFS+Trie 把字符用数字表示，简化建树 插入 查找过程-poj 2967 BFS+Trie the characters, numerals inserted lookup process to simplify the achievements