Sloc, Cloc and Code: scc is a very fast accurate code counter with complexity calculations and COCOMO estimates written in pure Go
Codebase intelligence for AI and humans: code health scores, auto-generated docs, git analytics, dead code detection, and architectural decisions via MCP.
Rainbond is an open-source container platform that requires no Kubernetes expertise. Its core capabilities are 100% open source. It abstracts away infrastructure complexity and provides a unified way to deploy and manage business applications, AI-generated projects, open-source AI software, and large language model services. AI helps teams deploy
🔰 Instant PHP quality checks from your console
Codebase intelligence for TypeScript and JavaScript. Health, complexity hotspots, duplication, architecture boundaries, circular dependencies, design-system drift, and unused code, from one graph. CLI, GitHub Action, LSP, MCP, and VS Code. Rust, MIT licensed.
Mesa is an open-source Python library for agent-based modeling, ideal for simulating complex systems and exploring emergent behaviors.
flake8 is a python tool that glues together pycodestyle, pyflakes, mccabe, and third-party plugins to check the style and quality of some python code.
A simple code complexity analyser without caring about the C/C++ header files or Java imports, supports most of the popular languages.
Library for (de-)serializing data of any complexity (supports JSON, and XML)
Hedy is a gradual programming language to teach children programming. Gradual languages use different language levels, where each level adds new concepts and syntactic complexity. At the end of the Hedy level sequence, kids master a subset of syntactically valid Python.
A Python application for tracking, reporting on timing and complexity in Python code
Library for calculating the complexity of PHP code units
Alcinoe empowers developers to build fast, modern apps without the usual complexity or performance bottlenecks. It keeps the focus on innovation—not tool constraints—delivering top performance, deep customization, and great cross-platform UX while staying independent of GAFA ecosystems.
Code quality analysis for Python in the age of AI coding.
AWS SaaS Boost is a ready-to-use toolset that removes the complexity of successfully running SaaS workloads in the AWS cloud.
Award winning software library for nonlinear dynamics and nonlinear timeseries analysis
Blazingly fast cognitive complexity analysis for Python, written in Rust.
GraphQL Router / API Gateway framework written in Golang, focussing on correctness, extensibility, and high-performance. Supports Federation v1 & v2, Subscriptions & more.
Book and code for Think Complexity, 2nd edition
CSS selectors complexity and performance analyzer
McCabe complexity checker for Python
Pretty CSS analytics on the CLI
Active Directory password filter featuring breached password checking and custom complexity rules
Free DSA handbook for coding interviews: data structures, algorithms, and LeetCode patterns with Python, Java, and C++ implementations, complexity tables, edge cases, and FAQs.
Prove and remove accidental codebase complexity without breaking behavior.
Claude skill: refactor code to reduce cyclomatic complexity
A deterministic, zero-token Cognitive Complexity calculation library, CLI tool, and GitHub Action for Dart and Flutter repositories.
Code Buster reports dependency wiring, dead code, cycles, duplication, complexity, architecture-policy violations, feature flags, security and style heuristics, quality scores, and remediation plans.
Automatically route each Pi prompt to a model based on task complexity, price, speed, or context length. Smart model router for pi.
Code review via the change impact measure
Clean ML Framework 2026: Simplify Machine Learning Code Structure and Hyperparameters
Help your agents find the smoking gun they're looking for. Optimization evidence for agents: find complexity hotspots.
A /human-review skill for Claude Code: assembles one page that lets a human review a change set fast — diagram deltas, Code City, a feature video, complexity delta, and deep-linked snippets.
Integer multiplication below n log n: a conditional witness kappa = 6685733/10^10 (> 2^-11) for T(n) = O(n (log n)^(1-kappa)) in the multitape model, building on OpenAI's problem and Colkitt's integer-mult-bounds: certificates, independent replays, Lean 4 checks