Use Circular Code Dependency Detector with your AI.
Connect your account once and let the AI you already use work with it, without building another integration. Identify import cycles and measure module interdependence in JavaScript, TypeScript, and Python projects.
Developed, maintained, and hosted by Vinkius.
MCP VERIFIED · PRODUCTION READY · VINKIUS GUARANTEED
Waiting for input…
Works with modern AI clients that support MCP, including ChatGPT, Claude, Cursor, and more.
Complete set · 3 capabilities
The complete Circular Code Dependency Detector capability set.
These are the exact actions your AI can choose when you ask it to work with Circular Code Dependency Detector.
01-03
3 capabilities in this set.
Part of 3 available through Circular Code Dependency Detector.
- 01
Compute coupling metrics
Compute coupling metrics for a module
- 02
Detect cycles
Detect circular dependencies
- 03
Scan dependencies
Scan a directory for dependencies
Observed, not estimated
612ms average. Fast in production.
Circular Code Dependency Detector is checked daily against the live service.
- Fastest day
- 455ms
- Slowest day
- 720ms
- 14-day trend
- Slowing+32%
Connect your client
One URL. Every client.
Activate the Connector, copy your link, and paste it into the client you already use. 3 capabilities arrive ready to run.
Preview access · not provider authentication
The vk_preview_* token belongs to Vinkius preview infrastructure. It lets Claude discover and display the capabilities of Circular Code Dependency Detector, so you can see the experience inside your AI.
It does not authenticate your account with Circular Code Dependency Detector. Actions requiring credentials or live account data may not run until you activate the Connector and authorize the service.
Circular Code Dependency Detector Connector
You're all set. Choose your MCP client and follow the setup instructions.
https://edge.vinkius.com/vk_preview_V2TywrXk4ZedJ9OsuD67krBjloqkZ6H14wDHFEBh/mcpClaude Desktop
Follow the steps below to connect in seconds.
- 1In Claude Desktop, open Settings → Connectors.
- 2Click “Add custom connector” and paste the connector link above as the remote MCP server URL.
- 3Click Add and start a new chat — Circular Code Dependency Detector capabilities are ready to use.
{
"mcpServers": {
"circular-code-dependency-detector-mcp": {
"url": "https://edge.vinkius.com/vk_preview_V2TywrXk4ZedJ9OsuD67krBjloqkZ6H14wDHFEBh/mcp"
}
}
}
Claude
ChatGPT
Cursor
VS Code
Windsurf
Claude Code
JetBrains
Cline
Step-by-step instructions for each client are in the guide. How to connect
FAQ
Questions Circular Code Dependency Detector owners ask.
- 01
How do I start detecting cycles in my project?
First, use the scan_dependencies capability on your project directory to generate a dependency map. Then, pass that map into detect_cycles to see all identified loops.
- 02
Can I analyze Python projects?
Yes, the scanner supports python syntax alongside javascript and typescript.
- 03
What are coupling metrics?
They quantify module interdependence. By using compute_coupling_metrics, you can see the in-degree and out-degree of a module to find high-risk files.
Explore
More in Developer Tools
Hono Router Pattern Matcher AI Connector
Deterministic Hono-style route pattern matching for edge computing.
Viewjson-state-diff-generator AI Connector
High-precision JSON state comparison for debugging agentic workflows.
ViewRegex Tester Explainer AI Connector
Validate, test, and deconstruct regular expressions across multiple flavors.
ViewPrompt Cache Hit Rate Calculator AI Connector
Analyze LLM prompt prefix caching efficiency and performance.
View
Suggestions
Dependency Coupling Fitness Function AI Connector
Enforce clean architecture boundaries by validating dependency directions.
ViewDocker Compose Validator AI Connector
Validate Docker Compose files for structural errors, port conflicts, and dependency cycles.
ViewAgent Task Decomposition Engine AI Connector
Break complex goals into structured subtasks with deterministic complexity scoring.
ViewDAG Topological Scheduler AI Connector
Deterministic task scheduling and critical path analysis for multi-agent DAGs.
View
