awesome-repositories.com
ब्लॉग
awesome-repositories.com

AI-संचालित खोज के साथ बेहतरीन ओपन-सोर्स रिपॉजिटरी खोजें।

एक्सप्लोर करेंक्यूरेटेड खोजेंओपन-सोर्स विकल्पसेल्फ-होस्टेड सॉफ्टवेयरब्लॉगसाइटमैप
प्रोजेक्टहमारे बारे मेंहम रैंकिंग कैसे करते हैंप्रेसMCP सर्वर
कानूनीगोपनीयताशर्तें
© 2026 Bringes Technology SRL·VAT RO45896025·hello@awesome-repositories.com
·

1 रिपॉजिटरी

Awesome GitHub RepositoriesTries

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.

Awesome Tries GitHub Repositories

AI के साथ बेहतरीन रिपॉजिटरी खोजें।हम AI का उपयोग करके सबसे सटीक रिपॉजिटरी खोजेंगे।
  • wangzheng0822/algowangzheng0822 का अवतार

    wangzheng0822/algo

    23,159GitHub पर देखें↗

    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.

    Python
    GitHub पर देखें↗23,159
  1. Home
  2. Software Engineering & Architecture
  3. String Processing Algorithms
  4. Prefix-Based Pattern Matching Algorithms
  5. Tries