GenPark Monorepo Dependency Cycle Detector
Resolves monorepo dependency cycles and plans topological build-orders using Tarjan SCC and Kahn algorithms.
Engineered as a deterministic, zero-dependency Python skill, this tool provides production-grade functional parity for autonomous coding agents, enabling robust Python AST static analysis, codebase refactoring, and architectural dependency auditing. It excels at resolving complex monorepo dependency cycles and planning optimal topological build-orders through the application of advanced Tarjan SCC and Kahn algorithms, ensuring streamlined development and deployment workflows.
Key Features
017 GitHub stars
02Optimizes LLM context efficiency by pruning dead code, identifying breaking API surface differences, and pinpointing refactoring hotspots.
03Performs 100% deterministic AST code parsing for accurate syntax-tree traversals, cyclomatic complexity calculations, and dependency graph generation.
04Offers native Model Context Protocol (MCP) compatibility for seamless integration with AI agent clients like Cursor IDE, Claude Desktop, and Windsurf.
05Operates with zero external pip dependencies, leveraging standard Python 3.9+ built-in AST and pure graph algorithms.
Use Cases
01Planning optimal topological build-orders for efficient software compilation and deployment.
02Performing static analysis for automated codebase refactoring and architectural dependency auditing.
03Resolving complex dependency cycles within monorepos to improve project architecture.