Nothing
rtrie: 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.
Getting started
Browse package contents
Package details |
|
|---|---|
| Author | Casimir Saternos [aut, cre] |
| Maintainer | Casimir Saternos <cas.saternos@gmail.com> |
| License | MIT + file LICENSE |
| Version | 0.1.1 |
| URL | https://github.com/ezgraphs/rtrie |
| Package repository | View on CRAN |
| Installation |
Install the latest version of this package by entering the following in R:
|
Try the rtrie package in your browser
Any scripts or data that you put into this service are public.
