A Simple R-Based Implementation of a Trie (A.k.a. Digital Tree/Radix Tree/Prefix Tree)

A simple R-based implementation of a Trie (a.k.a. digital tree/radix tree/prefix tree) A trie, also called digital tree and sometimes radix tree or prefix tree is a kind of search tree. This ordered tree data structure is used to store a dynamic set or associative array where the keys are usually strings.


Reference manual

It appears you don't have a PDF plugin for this browser. You can click here to download the reference manual.


0.1.1 by Casimir Saternos, a year ago


Report a bug at https://github.com/ezgraphs/rtrie/issues

Browse source code at https://github.com/cran/rtrie

Authors: Casimir Saternos [aut, cre]

Documentation:   PDF Manual  

MIT + file LICENSE license

Suggests knitr, rmarkdown, testthat, microbenchmark

See at CRAN