搜索资源列表
Trie
- Trie树既可用于一般的字典搜索，也可用于索引查找。对于给定的一个字符串a1,a2,a3,...,an.则采用TRIE树搜索经过n次搜索即可完成一次查找。不过好像还是没有B树的搜索效率高，B树搜索算法复杂度为logt(n+1/2).当t趋向大，搜索效率变得高效。怪不得DB2的访问内存设置为虚拟内存的一个PAGE大小，而且帧切换频率降低，无需经常的PAGE切换。
TRIE
- 字典树，实现字典树的插入删除查找功能。效率高-Dictionary tree, insert the tree removed to achieve a dictionary lookup function. Efficient
libdatrie-0.1.0.tar
- 介绍trie数组的算法实现，国外大牛写的，很好-Introduced array trie algorithm, written by foreign cattle, very good
Trie
- Trie数据结构，一种字符串存储方式，可以提高字符串的查找效率-a data structure of Trie, which can be used for storing the strings and improve the searching efficiency for a given string
datrie_cvs20061001.tar
- This an implementation of double-array structure for representing trie, as proposed by Junichi Aoe [1]. Trie is a kind of digital search tree, an efficient indexing method with O(1) time complexity for searching. Comparably as efficient as h
Trie
- poj3283的代码，是学习Trie的好材料～-poj3283 code is studying the well Trie Materials ~
Algorithms
- 压缩包中包括几个常用算法对应的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, t
Trie
- trie树的一个实现 trie树是在字符串匹配中常用的一种高效数据结构-trie tree trie tree is a realization of the string matching used in an efficient data structure
sftrie_src
- Shortest Common Superstring Problem by using suffix trie and branch-and-bound. This code is from Shin, YoungJin, Korea
Trie
- trie 树 什么是 trie 树 ？ ◇ trie 树是一种用于快速检索的多叉树结构。 ◇ 和二叉查找树不同，在 trie 树中，每个结点上并非存 储一个元素。 ◇ trie 树把要查找的关键词看作一个字符序列。并根据 构成关键词字符的先后顺序构造用于检索的树结构。 ◇ 在 trie 树上进行检索类似于查阅英语词典。 一棵 m 度的 trie 树或者为空，或者由 m 棵 m 度的 trie 树构 成。-data structure
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
- A implementation of Trie