搜索资源列表
trie
- 1． Trie树作为一种索引树，这种结构对于大小变化很大的关键字特别有用。利用Trie树实现一个英语单词辅助记忆系统，完成相应的建表和查表程序。2． 不限定Trie树的层次。每个叶子结点只含一个关键字，采用单字符逐层分割的策略，实现Trie树的插入、删除和查询的算法，查询可以有两种方法：查询一个完整的单词或者实现以某几个字母开头的单词。
Trie
- Trie树既可用于一般的字典搜索，也可用于索引查找。对于给定的一个字符串a1,a2,a3,...,an.则采用TRIE树搜索经过n次搜索即可完成一次查找。不过好像还是没有B树的搜索效率高，B树搜索算法复杂度为logt(n+1/2).当t趋向大，搜索效率变得高效。怪不得DB2的访问内存设置为虚拟内存的一个PAGE大小，而且帧切换频率降低，无需经常的PAGE切换。
LC-trie
- lc-trie 路由查找算法， lc-trie 路由查找算法
trie
- trie字典树 字典树C语言实现的算法。-trie dictionary tree C language implementation of the algorithm.
TRIE
- 字典树，实现字典树的插入删除查找功能。效率高-Dictionary tree, insert the tree removed to achieve a dictionary lookup function. Efficient
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
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 ~
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.
B01AB525d01
- The problem of efficient data structures for IP lookups has been well studied in literature. Techniques such as LC tries and Extensible Hashing are commonly used. In this paper, we address the problem of generalizing LC tries and Extensible H
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
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
Trie
- trie 树 什么是 trie 树 ？ ◇ trie 树是一种用于快速检索的多叉树结构。 ◇ 和二叉查找树不同，在 trie 树中，每个结点上并非存 储一个元素。 ◇ trie 树把要查找的关键词看作一个字符序列。并根据 构成关键词字符的先后顺序构造用于检索的树结构。 ◇ 在 trie 树上进行检索类似于查阅英语词典。 一棵 m 度的 trie 树或者为空，或者由 m 棵 m 度的 trie 树构 成。-data structure
trie
- A implementation of Trie