Project Summary
PATRICIA Trie
Practical Algorithm to Retrieve Information Coded in Alphanumeric
"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 strings of characters, bit strings such as integers or IP addresses, or generally arbitrary sequences of objects in lexicographical order. Sometimes the names radix tree and crit bit tree are only applied to trees storing integers and Patricia trie is retained for more general inputs, but the structure works the same way in all cases." -- Wikipedia
In a Nutshell, patricia-trie...
- ...
- ...
- ...
-
...
took an estimated 2 years of effort (COCOMO model)
starting with its first commit in November, 2008
ending with its most recent commit about 1 year ago
Activity
30 Day Summary Apr 14 2013 — May 14 2013
|
12 Month Summary May 14 2012 — May 14 2013
|
Community
Copyright
©
2013
Black Duck Software, Inc.
and its contributors, Some Rights Reserved. Unless otherwise marked, this work is licensed under a
Creative Commons Attribution 3.0 Unported License
. Ohloh
®
and the Ohloh logo are trademarks of
Black Duck Software, Inc.
in the United States and/or other jurisdictions. All other trademarks are the property of their respective holders.