Description: 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 hashing,
trie also provides flexibility on incremental matching and key spelling
manipulation. This makes it ideal for lexical analyzers, as well as spelling
dictionaries.
See the details of the implementation at [2]:
http://linux.thai.net/~thep/datrie/datrie.html
Historically, this was first implemented as C++ classes in a library called
midatrie [2], but later simplified and rewritten from scratch in C.-This is 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 hashing,
trie also provides flexibility on incremental matching and key spelling
manipulation. This makes it ideal for lexical analyzers, as well as spelling
dictionaries.
See the details of the implementation at [2]:
http://linux.thai.net/~thep/datrie/datrie.html
Historically, this was first implemented as C++ classes in a library called
midatrie [2], but later simplified and rewritten from scratch in C. Platform: |
Size: 34816 |
Author:lucoy |
Hits:
Description: 这是一个经典的通过双数组实现Trie树的示例-This is an implementation of double-array structure for representing trie,
as proposed by Junichi Aoe Platform: |
Size: 359424 |
Author: |
Hits:
Description: 双数组辞典生成程序源码。运用双数组实现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 effective. Often used for sub-word dictionary making. Can be used directly. Platform: |
Size: 230400 |
Author:hxb |
Hits:
Description: 1. 经典的算法实现 2. 服务器端 3. 正确，易于使用和改造, 一个头文件一个算法，并附带一个demo.
1. 一个算法用一个.h文件表示放到include下.2. 算法演示的demo程序放到src下.3. 程序正确通过后，请发起Pull Requests，代码被验证后入库，并在README中发布新算法实现。
已实现 ( Implemented ):
Array shuffle
Prime test(trial division)
Prime test(Miller-Rabin s method)
2D Array
Arbitary Integer
Linear congruential generator
Maximum subarray problem
Bit-Set
Queue
Stack
Binary Heap
Fibonacci Heap
Priority Queue (list based)
Bubble sort
Selection sort
Insertion sort
Radix sort
Quick sort
Merge sort
Heap sort
Double linked list
Skip list
Self-organized linked-list ops (move-to-front, move-ahead-one)
Largest common sequence
Binary search tree
Dynamic order statistics
Red-black tree
Interval tree
Prefix Tree(Trie)
Suffix Tree
B-Tree
Suffix Array等-(classical algorithms implementations) (based on linux/gcc) (correct! and ease of use, one .header file per algorithm) one .header file per algorithm. )( one demo per algorithm. )(Please Use Fork+Pull Requests !!! Correctness is the most important!) Platform: |
Size: 1636352 |
Author:汪小君 |
Hits:
Search - double-array trie