awesome-repositories.com
博客
MCP
awesome-repositories.com

通过 AI 驱动的搜索,发现最优秀的开源仓库。

探索精选搜索开源替代品自托管软件博客网站地图
项目MCP 服务器关于排名机制媒体报道
法律隐私政策服务条款
© 2026 Bringes Technology SRL·VAT RO45896025·hello@awesome-repositories.com
·

6 个仓库

Awesome GitHub RepositoriesSegment Trees

Tree data structures used for storing intervals or segments to enable efficient range-based queries.

Explore 6 awesome GitHub repositories matching programming languages & runtimes · Segment Trees. Refine with filters or upvote what's useful.

Awesome Segment Trees GitHub Repositories

用 AI 发现最棒的仓库。我们将通过 AI 为您搜索最匹配的仓库。
  • kdn251/interviewskdn251 的头像

    kdn251/interviews

    64,941在 GitHub 上查看↗

    This project serves as a centralized knowledge base and study guide for mastering computer science fundamentals and technical interview preparation. It provides a structured collection of algorithmic implementations, data structure guides, and theoretical references designed to support professional development and problem-solving skills. The repository distinguishes itself through a taxonomy-based organization that maps complex concepts into a hierarchical structure. It standardizes the expression of abstract data structures and algorithms using a consistent programming language, with impleme

    Explains how to store interval data in tree nodes to facilitate efficient range-based queries and updates.

    Javaalgorithmalgorithm-challengesalgorithm-competitions
    在 GitHub 上查看↗64,941
  • kodecocodes/swift-algorithm-clubkodecocodes 的头像

    kodecocodes/swift-algorithm-club

    29,099在 GitHub 上查看↗

    This project is a comprehensive collection of common computer science algorithms and data structures implemented in Swift. It serves as an educational reference and library for studying computational complexity, algorithmic logic, and data structure engineering through practical code examples. The repository provides a wide suite of data structure implementations, including various types of linked lists, heaps, hash tables, and an extensive range of hierarchical trees such as Red-Black, B-Tree, and Splay trees. It also covers diverse sorting and searching techniques, from basic bubble sort to

    Implements segment trees with the ability to update elements while maintaining aggregate values.

    Swiftalgorithmsdata-structuresswift
    在 GitHub 上查看↗29,099
  • oi-wiki/oi-wikiOI-wiki 的头像

    OI-wiki/OI-wiki

    26,176在 GitHub 上查看↗

    This project is a comprehensive, community-maintained knowledge base and toolkit designed for competitive programming. It serves as a centralized repository for algorithmic theory, data structures, and mathematical techniques, providing a structured reference for informatics and collegiate programming competitions. The project distinguishes itself by integrating educational content with a robust suite of automation utilities. It provides a complete workflow for competitive programming, including tools for automated test case generation, solution verification, and direct interaction with onlin

    Combines tree decomposition and segment trees to perform efficient dynamic programming on tree structures.

    TypeScriptacm-icpcacm-icpc-handbookalgorithms
    在 GitHub 上查看↗26,176
  • grafana/pyroscopegrafana 的头像

    grafana/pyroscope

    11,503在 GitHub 上查看↗

    Pyroscope is a continuous profiling platform designed to collect, store, and visualize application performance data. It functions as an application performance management suite that tracks historical resource usage to identify bottlenecks and detect performance regressions over time. The platform distinguishes itself through its use of kernel-level instrumentation and dynamic runtime hooks, which allow for performance monitoring without requiring manual code modifications or application restarts. It employs a sidecar agent architecture to offload telemetry processing, utilizing delta-encoded

    Stores hierarchical profiling data in a compressed tree structure to enable efficient navigation of stack traces.

    Gocontinuous-profilingdeveloper-toolsdevops
    在 GitHub 上查看↗11,503
  • awangdev/leet-codeawangdev 的头像

    awangdev/leet-code

    4,344在 GitHub 上查看↗

    这是一个精选的算法模式、数据结构实现和系统设计笔记参考库。它作为 Java 算法问题集和竞赛编程指南,为 LeetCode 和 LintCode 等平台上的编码挑战提供了解决方案合集。 该库以其针对高级数据结构和算法策略的全面 Java 实现而著称。它包括用于解决复杂问题的详细参考资料,并附带时间和空间复杂度分析。 该项目涵盖了广泛的计算机科学基础知识,包括算法设计、数据结构实现和系统设计。其内容涵盖图论、动态规划、搜索与优化以及线性数据处理技术。它还包括关于基础设施可扩展性、性能缓存和软件架构模式的笔记。

    Provides segment tree implementations for performing range queries and updates in logarithmic time.

    Javaalgorithmdynamicprogrammingjava
    在 GitHub 上查看↗4,344
  • ebtech/rust-algorithmsEbTech 的头像

    EbTech/rust-algorithms

    3,972在 GitHub 上查看↗

    这是一个用 Rust 编写的标准数据结构和算法实现合集。它提供了一套专为竞赛编程和系统工程设计的专业库。 该项目分为图论、数论、区间查询和字符串处理等不同的工具包。它包含用于计算最短路径和网络流、执行素性测试和模运算以及管理关联区间查询的实现。 该库涵盖广泛的计算领域,包括通过快速傅里叶变换进行的信号处理、使用后缀数组和字典树的文本分析,以及通过坐标压缩和排序工具进行的数据组织。它还提供用于从文件或标准 I/O 解析输入数据的工具。

    Provides segment trees with lazy propagation for efficient deferred range updates and queries.

    Rustalgorithmalgorithmscodeforces
    在 GitHub 上查看↗3,972
  1. Home
  2. Programming Languages & Runtimes
  3. Programming Utilities
  4. Data Structure and Type Helpers
  5. Data Structures
  6. Hierarchical Tree Structures
  7. Segment Trees

探索子标签

  • Dynamic Tree OptimizationUpdates tree-based states efficiently by combining tree decomposition with segment trees for logarithmic time queries. **Distinct from Segment Trees:** Focuses on tree-based DP, distinct from general segment tree implementations.
  • Lazy PropagationTechniques for deferring updates to child nodes in segment trees to optimize range modifications. **Distinct from Segment Trees:** Specializes general segment trees by adding lazy propagation for efficient range updates.
  • Profiling Storage TreesHierarchical tree structures optimized for storing and querying stack trace data. **Distinct from Segment Trees:** Distinct from general segment trees: focuses on hierarchical profiling data storage rather than range-based interval queries.
  • Segment Tree DP OptimizationUses segment trees or Fenwick trees to perform range queries and updates during state transitions. **Distinct from Segment Trees:** Focuses on DP-specific range query optimization, distinct from general-purpose tree data structures.