A serializable compact prefix tree (also known as Radix tree or Patricia tree or space-optimized trie) implementation in JavaScript.
-
Updated
Oct 8, 2019 - JavaScript
#
compact-prefix-tree
Here are 2 public repositories matching this topic...
a HTTP route multiplexer, based on radix trees
-
Updated
Mar 26, 2019 - Scheme
Improve this page
Add a description, image, and links to the compact-prefix-tree topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the compact-prefix-tree topic, visit your repo's landing page and select "manage topics."