| Projects on Google Code | Results 1 - 3 of 3 |
=Major features=
STL-compatible, high-performance template containers and auxiliary classes useful for stringology with fine-grained low level design
=Library features=
* set & map containers with trie (digital/radix search tree) functionality - `trie_set` & `trie_map`;
* set & map containe...
c,
stl,
template,
patricia,
trie,
suffix,
tree,
maximal,
repeats,
lowest,
common,
ancestor,
levenshtein,
hamming,
distance
=PATRICIA Trie=
_Practical Algorithm to Retrieve Information Coded in Alphanumeric_
This is a general purpose implementation of a PATRICIA Trie in Java. It implements the [http://java.sun.com/javase/6/docs/api/java/util/SortedMap.html SortedMap] interface and integrates well with the
[http://j...
A radix tree, Patricia trie/tree, or crit bit tree is a specialized set data structure based on the trie that is used to store a set of strings. In contrast with a regular trie, the edges of a Patricia trie are labelled with sequences of characters rather than with single characters. These can be st...