1 repository
Hierarchical tree structures used for efficient retrieval and matching of string prefixes.
Distinct from Prefix-Based Pattern Matching Algorithms: Specializes prefix-based pattern matching by specifically implementing the trie data structure.
Explore 1 awesome GitHub repository matching software engineering & architecture · Tries. Refine with filters or upvote what's useful.
This project is a data structures and algorithms library providing a collection of fifty standard code implementations for managing data and solving common computational problems. It serves as an algorithm implementation reference and study resource for educational use. The codebase covers graph theory implementations for modeling networks and performing searches, as well as string pattern matching libraries for the retrieval of character sequences. It includes a collection of hierarchical data structures, such as binary search trees and priority heaps, and provides optimized solutions for dy
Organizes character sequences into a hierarchical structure for fast string pattern retrieval.