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

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

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

7 个仓库

Awesome GitHub RepositoriesTree-Based Optimization

Calculates optimal values across tree structures by performing depth-first searches to aggregate results from child nodes.

Distinct from Tree Node Templates: Focuses on DP-based tree aggregation, distinct from build-time tree-shaking.

Explore 7 awesome GitHub repositories matching software engineering & architecture · Tree-Based Optimization. Refine with filters or upvote what's useful.

Awesome Tree-Based Optimization GitHub Repositories

用 AI 发现最棒的仓库。我们将通过 AI 为您搜索最匹配的仓库。
  • 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

    Aggregates optimal values across tree structures using depth-first search techniques for dynamic programming.

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

    MaaAssistantArknights/MaaAssistantArknights

    21,583在 GitHub 上查看↗

    MaaAssistantArknights is a cross-platform automation engine designed for mobile games, utilizing computer vision and input simulation to perform routine tasks. It functions as an Android emulator controller, managing game lifecycles, resource farming, and infrastructure optimization through structured, scripted workflows. The project distinguishes itself through a modular configuration system that allows users to define complex automation logic via external instruction files. This framework supports dynamic task modification, configuration inheritance, and schema validation, ensuring that cus

    Calculates optimal operator assignments to facilities to maximize resource production.

    C++arknightscomputer-visionmaa
    在 GitHub 上查看↗21,583
  • sharingsource/logicstack-leetcodeSharingSource 的头像

    SharingSource/LogicStack-LeetCode

    7,495在 GitHub 上查看↗

    LogicStack-LeetCode is a curated repository of solved algorithm problems and data structure implementations, primarily drawn from the LeetCode platform. Its core identity is a structured collection of solutions designed to support technical interview preparation and competitive programming practice, with each solution accompanied by complexity analyses to help engineers understand performance trade-offs. The repository distinguishes itself through its breadth of coverage across fundamental algorithmic patterns and data structures. It includes implementations for array manipulation, string pro

    Solves the longest path problem in trees with distinct adjacent character constraints.

    algorithminterview-practiceinterview-questions
    在 GitHub 上查看↗7,495
  • deap/deapDEAP 的头像

    DEAP/deap

    6,336在 GitHub 上查看↗

    Represents programs as nested tree structures with typed nodes for genetic programming operations.

    Python
    在 GitHub 上查看↗6,336
  • algorithmicsuperintelligence/openevolvealgorithmicsuperintelligence 的头像

    algorithmicsuperintelligence/openevolve

    5,421在 GitHub 上查看↗

    OpenEvolve is an open-source framework for evolutionary computation that uses language models to drive automated optimization across multiple domains. It can evolve system prompts for large language models, refine source code across programming languages, search for optimal GPU kernel configurations, discover interpretable mathematical expressions from data, and maintain diverse populations of high-performing solutions. The framework integrates multiple evolutionary strategies, including MAP-Elites diversity mapping and island-based topologies, to avoid premature convergence and preserve a wid

    Evo evolves a program that passes all test cases on an online judge by iteratively mutating and selecting candidate solutions.

    Pythonalpha-evolvealphacodealphaevolve
    在 GitHub 上查看↗5,421
  • chrxh/alienchrxh 的头像

    chrxh/alien

    5,354在 GitHub 上查看↗

    Evolve is an evolution-based organism designer and GPU-accelerated artificial life simulator that combines interactive particle physics with a real-time simulation editor. At its core, it runs genetic algorithm evolution on self-replicating graph structures to evolve digital organisms, offloading particle physics, neural networks, and rendering entirely to the GPU through a compute shader pipeline for real-time performance. The project distinguishes itself with graph-based organism design that uses a directed graph editor to visually define organism structure, connections, and neural controll

    Evolves digital organisms with neural networks and genetic algorithms to develop complex behaviors without manual programming.

    C++agent-based-simulationartificial-lifecuda
    在 GitHub 上查看↗5,354
  • soapyigu/leetcode-swiftsoapyigu 的头像

    soapyigu/LeetCode-Swift

    4,958在 GitHub 上查看↗

    LeetCode-Swift is a collection of algorithm solutions written in Swift, designed for coding interview preparation. Each solution is implemented as a self-contained function with no external dependencies, making it easy to run and test. The repository organizes solutions by topic and company, and every file includes time and space complexity annotations, allowing quick evaluation of algorithmic efficiency. What sets this repository apart is its flat file structure and the way solutions are tagged with the companies that asked them in interviews, enabling targeted practice. All code resides in

    Computes optimal solutions on binary trees with adjacency constraints using recursion and two-state DP.

    Swiftalgorithmdata-structuresinterview
    在 GitHub 上查看↗4,958
  1. Home
  2. Software Engineering & Architecture
  3. Trees
  4. Tree Node Templates
  5. Tree-Based Optimization

探索子标签

  • Adjacency-Constrained Tree DP1 个子标签Recursive algorithms that compute optimal values on binary trees with adjacency constraints using two-state tracking. **Distinct from Tree-Based Optimization:** Distinct from Tree-Based Optimization: specifically handles adjacency constraints (e.g., cannot pick adjacent nodes).
  • Genetic Program Evolution1 个子标签Represents solutions as tree structures and applies crossover, mutation, and selection to evolve them over generations. **Distinct from Tree-Based Optimization:** Distinct from general Tree-Based Optimization: specifically for evolving programs via genetic operators, not for DP-based tree aggregation.
  • Genetic Program TreesRepresents programs as nested tree structures with typed nodes for crossover and mutation on symbolic expressions. **Distinct from Tree-Based Optimization:** Distinct from general Tree-Based Optimization: specifically for representing and evolving programs, not for DP-based tree aggregation.