.NET Implementations of Trie Data Structures for Substring Search, Auto-completion and Intelli-sense. Includes: patricia trie, suffix trie and a trie implementation using Ukkonen's algorithm.
i have added the update and remove implementation for TrieNodeBase
the user can use
ITrie<int> trie = new Trie<int>();trie.delete(key) // works
the rest of the algorithms delete and update were left unimplemented
ITrie<int> trie = new SuffixTrie<int>();trie.delete(key) // throws unimplemented exception
i have added the update and remove implementation for TrieNodeBase the user can use
ITrie<int> trie = new Trie<int>();
trie.delete(key) // works
the rest of the algorithms delete and update were left unimplementedITrie<int> trie = new SuffixTrie<int>();
trie.delete(key) // throws unimplemented exception