Location:
Search - trie tree
Search list
Description: trie tree, 是一个高效处理字符串的比较常见的算法,能够让我们在复杂度 O(log(n))的情况下插入和查询一个字符串-trie tree, is an efficient treatment of the more common string algorithms, to enable us to the complexity of O (log (n)) the case of insert and query a string
Platform: |
Size: 1024 |
Author: hekui |
Hits:
Description: 用Trie树构建英文字典? 肨rie树构建英文字典用Trie树构建英文字典-Trie tree used to build an English language dictionary?肨rie tree constructed English dictionary?肨rie trees used to build English Dictionary English Dictionary Trie Tree Construction
Platform: |
Size: 3072 |
Author: |
Hits:
Description: 什么是Trie树？
Trie树的性质和特点
Trie树的实现
Trie树是做什么的？
-What is the Trie tree? Trie tree of the nature and characteristics of the realization of Trie tree Trie tree is doing what?
Platform: |
Size: 232448 |
Author: tearnon |
Hits:
Description: 1． Trie树作为一种索引树，这种结构对于大小变化很大的关键字特别有用。利用Trie树实现一个英语单词辅助记忆系统，完成相应的建表和查表程序。2． 不限定Trie树的层次。每个叶子结点只含一个关键字，采用单字符逐层分割的策略，实现Trie树的插入、删除和查询的算法，查询可以有两种方法：查询一个完整的单词或者实现以某几个字母开头的单词。-1. Trie index tree as a tree, this structure changed greatly for the size of keywords is particularly useful. Trie tree realize the use of an English word auxiliary memory system to complete the appropriate procedures to build tables and look-up table. 2. Trie is not limited to the level of the tree. Each leaf node contains only one keyword, a single-character layer by layer segmentation strategy, realize Trie tree insert, delete and query algorithms, there are two methods of inquiry: inquiry or a complete word in order to realize a number of letters at the beginning of words.
Platform: |
Size: 972800 |
Author: 蒋笑语 |
Hits:
Description: 字典树实现，实现对单词的添加和删除。
速度较快-Dictionary tree realization, the realization of the word to add and remove. Faster
Platform: |
Size: 1024 |
Author: pop |
Hits:
Description: Trie树既可用于一般的字典搜索，也可用于索引查找。对于给定的一个字符串a1,a2,a3,...,an.则采用TRIE树搜索经过n次搜索即可完成一次查找。不过好像还是没有B树的搜索效率高，B树搜索算法复杂度为logt(n+1/2).当t趋向大，搜索效率变得高效。怪不得DB2的访问内存设置为虚拟内存的一个PAGE大小，而且帧切换频率降低，无需经常的PAGE切换。-Trie tree can be used for general dictionary english, can also be used to search the index. For a given a string a1, a2, a3 ,..., an. Is used TRIE tree english english after n times to complete a search. But they did not like B-tree search efficiency, B tree search algorithm complexity is logt (n+ 1/2). When t trend, and search efficiency becomes efficient. No wonder the DB2 access memory settings for the virtual memory size of a PAGE, and the frame switching frequency to reduce the need for frequent switching PAGE.
Platform: |
Size: 1024 |
Author: ruikobe |
Hits:
Description: 本程序利用Trie树实现了英语单词辅助记忆系统，并完成了相关的建表，查表以及存档等操作。-This procedure using Trie tree realize the English words auxiliary memory system, and complete the relevant built form, as well as the archive, such as look-up table operation.
Platform: |
Size: 3072 |
Author: 张林海 |
Hits:
Description: 内含多种经典数据结构的实现和注释，其中包括二叉树，哈夫曼树，键树，Trie树，有向图，无向图的实现以及各种排序算法。-Containing a variety of classic data structures and the realization of the Notes, including the tree, Huffman tree, key tree, Trie tree, directed graph, undirected graph, as well as realize the sorting algorithm.
Platform: |
Size: 26624 |
Author: Ra |
Hits:
Description: 一般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-array trie tree.
Platform: |
Size: 2048 |
Author: crazy |
Hits:
Description: 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. it implements like big engine searches trie.
Platform: |
Size: 35840 |
Author: saeed |
Hits:
Description: 压缩包中包括几个常用算法对应的POJ练习题的实现，包括，无向图的欧拉回路，点的割集，TRIE树，最优比率生成树，最小树形图-Compressed package includes several commonly used algorithms POJ corresponds to the realization of exercises, including, undirected graph of the Euler circuit, point cut sets, TRIE tree, the optimal ratio spanning tree, the smallest tree
Platform: |
Size: 5120 |
Author: ACMaryland |
Hits:
Description: trie字典树 字典树C语言实现的算法。-trie dictionary tree C language implementation of the algorithm.
Platform: |
Size: 1024 |
Author: rosa |
Hits:
Description: 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 of a string of public prefix to save storage space, is a relatively simple data structures. Is relatively simple to understand them, but the Trie tree also has its shortcomings, Trie tree is very big memory consumption.
Platform: |
Size: 2048 |
Author: youyu |
Hits:
Description: 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 of a string of public prefix to save storage space, is a relatively simple data structures. Is relatively simple to understand them, but the Trie tree also has its shortcomings, Trie tree is very big memory consumption.
Platform: |
Size: 55296 |
Author: youyu |
Hits:
Description: trie树的一个实现 trie树是在字符串匹配中常用的一种高效数据结构-trie tree trie tree is a realization of the string matching used in an efficient data structure
Platform: |
Size: 515072 |
Author: 袁梦 |
Hits:
Description: 利用Trie树实现一个英语单词辅助记忆系统，完成相应的建表和查表程序-Trie tree using an English word to achieve auxiliary memory system, complete the appropriate procedures for the construction table and look-up table
Platform: |
Size: 3072 |
Author: 黄黄 |
Hits:
Description: 字典树，实现字典树的插入删除查找功能。效率高-Dictionary tree, insert the tree removed to achieve a dictionary lookup function. Efficient
Platform: |
Size: 2048 |
Author: fanjingfan |
Hits:
Description: hash trie树 字典树，完整的sdk开发包 具有说明文档-hash trie tree dictionary tree, the complete development kit with documentation sdk
Platform: |
Size: 2094080 |
Author: 陈勇 |
Hits:
Description: 自己实现的trie树结构，能够较为高效实现数据的各种查询操作-Own implementation of trie tree structure, to a variety of more efficient data queries
Platform: |
Size: 595968 |
Author: bertrand |
Hits:
Description: N-trie树 实现字典树，可以从TXT文件中读取数据-N-trie tree to achieve the dictionary tree, you can read data from a TXT file
Platform: |
Size: 3072 |
Author: ddmonk |
Hits: