radix
Path tree
Implementation of a Radix Tree data structure for efficient path-based routing and lookup in a programming language.
Radix Tree implementation for Crystal
102 stars
10 watching
14 forks
Language: Crystal
last commit: 9 months ago
Linked from 1 awesome list
crystalradix-tree
Related projects:
Repository | Description | Stars |
---|---|---|
| An ANSI C implementation of a radix tree data structure | 1,127 |
| A C implementation of an efficient data structure for fast lookups and prefix matching in memory databases. | 775 |
| A library implementing an adaptive radix tree data structure to store and match routes for routing and filtering purposes. | 259 |
| A data structure implementation that combines the efficiency of hash tables with the sorted order of tries, optimized for fast search and insertion operations. | 375 |
| Generates graphical syntax trees for linguistic research using Ruby | 102 |
| An implementation of an asymptotically optimal sampling-based replanning algorithm for dynamic environments with unpredictable obstacles | 55 |
| Prints a list of paths as a tree-like structure | 463 |
| A C# Blazor wrapper for visualizing tree data structures using Viz.js. | 6 |
| A fast string sorting algorithm implemented in Go. | 192 |
| Generates documentation sets for the Crystal programming language using Dash. | 17 |
| A native Postgres driver for the Crystal programming language | 463 |
| A package extending R's dendrogram functionality with missing features. | 153 |
| A Ruby library for efficient linear algebra computations and matrix operations. | 108 |
| A lightweight dependency injection container for Crystal programming language | 33 |
| An XML parsing library that creates a read-only tree from an XML document. | 436 |