How rampageli/cp-templates works
Main components
• Basic Algorithms: Contains implementations for prefix and difference arrays and hashing techniques.
• Dynamic Programming (dp): Includes several DP strategies (e.g., tree DP, digit DP, knapsack, state compression, and tree re-rooting).
• Graph Algorithms: Features various graph-related implementations – BFS (including bidirectional and multi-source variants), Dijkstra, cycle detection, topological sorting, union-find.
• Mathematical Algorithms (math): Covers prime number generation (Sieve of Eratosthenes), greatest common divisor, prime factorization, modulo operations, and more.
• String Processing: Contains algorithms like longest common prefix (LCP), sequence detection, KMP for pattern matching, and string hashing.
• Tree Algorithms: Implements binary indexed trees (BIT), lowest common ancestor (LCA) calculations, and several variants of segment trees (both static and dynamic, with lazy propagation).
• Utilities (utlils): Provides helper scripts and templates such as input templates for programming contests, additional JavaScript scripts for competitive platforms, and tree construction utilities.
Relationships and interactions
• Interactions between different algorithm categories if applicable – for example, graph algorithms sometimes are built on basic data structures or may use utility functions.
Architectural patterns and design principles
• Modular Organization: Each major algorithm category lives in its own directory. This separation adheres to clean modular design, easing both understanding and maintenance.
• Reusability and Utility Sharing: The “utlils” directory encapsulates common functionalities (like input formatting and JavaScript snippets for different competitive programming platforms), which serve as foundational dependencies for the various algorithm implementations.
Relevant technologies, frameworks, or libraries
• Clear labels for every cluster/component with headings like “Dynamic Programming,” “Graph Algorithms,” “Utilities,” etc.