| Projects on Google Code | Results 1 - 10 of 21 |
Simple and small C header-based library with a C++ wrapper. Interfaces will include basic set/get, longest prefix, and iterator support.
Assumes keys can be treated as sequences, and that the elements of those sequences can be mapped.
a collection of java and possibly other language codes for trie structures.
Trie implementation for PHP. Useful for searching stuff.
= Outline =
This project provides a variety of trie implementations as C++ headers.
* Array-based tries
* BasicTrie: Sequential search trie
* TernaryTrie: Binary search trie
* DaTrie: Random access trie
* Succinct tries
* SuccinctTrie: Level-order binarized trie
* LoudsTrie: ...
=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
===What is Lanser?===
Lanser is an attempt to make a distributed search engine (_Doesn't require a central server_).It is made for small networks like College LAN's.The project is currently under development.The first working code is ready (_though it's not been tested thoroughly_).
= C++ Header Library of DAWG Dictionary Algorithm =
This project provides a library *dawgdic* for building and accessing
dictionaries implemented with directed acyclic word graphs (DAWG).
A dawg is constructed by minimizing a trie
as a deterministic finite automaton (DFA),
and thus the dawg...
=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...