An Implementation of Double-Array Trie

Contents What is Trie? What Does It Take to Implement a Trie? Tripple-Array Trie Double-Array Trie Suffix Compression Key Insertion Key Deletion Double-Array Pool Allocation An Implementation Download Other Implementations References What is Trie? Trie is a kind of digital search tree. (See [Knuth1972] for the detail of digital search tree.) [Fredkin1960] introduced the trie terminology, which is

[hirokist]

ダブル配列の実装より解説（英語）

[pacuum]

algorithm trie

[kkobayashi]

おお。これは分かりやすそうだ。ってかアルゴリズムってたのしーよなあ。あああ学生に戻りたい

[d-kami]

http://linux.thai.net/~thep/datrie/datrie.html

[hiromark]

TRIE の実装についての解説。