75 Open source projects that are alternatives of or similar to trie-prefix-tree

🇨🇳Open Chinese Convert is an opensource project for conversion between Traditional Chinese and Simplified Chinese.(java 中文繁简体转换)

Data Structures and Algorithms in Java

Fast specialized time-series database for IoT, real-time internet connected devices and AI analytics.

Graph algorithms in lua

A fast and space efficient Radix tree in Java

Fastest Trie structure (Linux & Windows)

Template Library of Data Structures in C++17

Traverser is a Java library that helps software engineers implement advanced iteration of a data structure.

Swift Collection Data Structures Library

Ergonomic trie data structure

A golang http router based on trie tree.

libgenerics is a minimalistic and generic library for C basic data structures.

A prefix tree (trie) implementation in go

A collection of powerful data structures

just for fun

Algo-Tree is a collection of Algorithms and data structures which are fundamentals to efficient code and good software design. Creating and designing excellent algorithms is required for being an exemplary programmer. It contains solutions in various languages such as C++, Python and Java.

Erasure coding (Reed–Solomon coding) in Go

PATRICIA, Double Array, LOUDS Trie implementations for Java

Fast, efficient, in-memory Full Text Search for Kotlin

Go efficient multilingual NLP and text segmentation; support english, chinese, japanese and other. Go 高性能多语言 NLP 和分词

A collection of common algorithms and data structures implemented in Java.

A C++ library providing fast language model queries in compressed space.

🔍 A friendly visualizer for some search algorithms, like DFS, BDS, Greedy and A*

Concurrent trie-hash map library

Trie (a.k.a. prefix tree) C# implementation. Has constant-time string prefix lookup.

Website built using React Framework for visualizing Pathfinding and Maze Generation Algorithms.

A Mixed Trie and Levenshtein distance implementation in Java for extremely fast prefix string searching and string similarity.

Data Structures & Algorithms. Includes solutions for Cracking the Coding Interview 6th Edition

This repository contains implementation of different AI algorithms, based on the 4th edition of amazing AI Book, Artificial Intelligence A Modern Approach

Golang radix tree implementation

Fast compressed trie dictionary library

Contains solutions and codes to various online competitive programming challenges and some good problems. The links to the problem sets are specified at the beginning of each code.

Garbage collector-sensitive patricia tree for IP/CIDR tagging

Compact tries for fixed-width keys

High-quality LeetCode solutions

Fast IP lookup table for IPv4/IPv6 prefixes

⚡️ A lightning fast HTTP router

Radix trees in Rcpp and R

A collection of common algorithms and data structures implemented in java, c++, and python.

A minimal and powerful trie based url path router (or mux) for Go.

Surprisingly space efficient trie in Golang(11 bits/key; 100 ns/get).

C++17 implementation of memory-efficient dynamic tries

.NET Implementations of Trie Data Structures for Substring Search, Auto-completion and Intelli-sense. Includes: patricia trie, suffix trie and a trie implementation using Ukkonen's algorithm.

A trie (prefix tree) data structure implementation in C#.

Data-Structures using C++.

Algorithmic Problems Solutions -- hash table code featured in geeksforgeeks

Java autocomplete library.

Python package for lexicon; Trie and DAWG implementation.

Golang Keyword extraction/replacement Datastructure using Tries instead of regexes

A Node implementation of the Aho-Corasick string matching algorithm based on DoubleArray Trie.

neato compression for key-value data

Deprecated: Use the @encapsule/arccore package that includes the graph library

An idiomatic and fast QP-trie implementation in pure Rust.

API for setting up a Minesweeper game environment in its simplicity and robustness

My take on an efficient implementation of a Trie in Javascript

A real-time JavaScript maze generator using the depth-first search algorithm

Implementation of various Data Structures and algorithms - Linked List, Stacks, Queues, Binary Search Tree, AVL tree,Red Black Trees, Trie, Graph Algorithms, Sorting Algorithms, Greedy Algorithms, Dynamic Programming, Segment Trees etc.

Efficient Trie-based regex unions for blacklist/whitelist filtering and one-pass mapping-based string replacing

A collection of powerful data structures

Performance shootout of various trie implementations