7 个仓库
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.
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.
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.
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.
Represents programs as nested tree structures with typed nodes for genetic programming operations.
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.
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.
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.