mcp-repo-graph
Related Servers
Alternatives to mcp-repo-graph
- AlicenseAqualityCmaintenanceA Model Context Protocol (MCP) server that helps large language models index, search, and analyze code repositories with minimal setup142,631 PyPI1,007MIT
- AlicenseNot gradedqualityNot gradedmaintenanceCodeGraph — Open-source code intelligence MCP server. Builds a semantic graph of your codebase (functions, classes, imports, call chains) and exposes it through 31 tools. Callers, callees, impact analysis, complexity metrics, unused code detection, AI context assembly, persistent memory, cross-project search. 15 languages via tree-sitter. Single Rust binary, local-first.203 npm-
- AlicenseNot gradedqualityFmaintenanceA powerful Model Context Protocol server that creates intelligent graph representations of your codebase with comprehensive semantic analysis capabilities, supporting 11 languages and 26 MCP methods.48 npm122MIT
- AlicenseNot gradedqualityDmaintenanceAn MCP server that transforms codebases into knowledge graphs using Neo4J, enabling AI assistants to understand code structure, relationships, and metrics for more context-aware assistance.28MIT
- AlicenseAqualityAmaintenanceA fully featured coding agent that uses symbolic operations (enabled by language servers) and works well even in large code bases. Essentially a free to use alternative to Cursor and Windsurf Agents, Cline, Roo Code and others.2943,883 PyPI30,830GPL 3.0
- FlicenseAqualityDmaintenanceAn MCP server that analyzes and traces business code flows across your codebase, enabling developers to quickly understand the complete execution path of features from frontend to backend to database.7-
Related Servers
- AlicenseBqualityCmaintenanceTransforms codebases into structural knowledge graphs for AI agents and developers, providing precise architectural awareness and dependency mapping.1537MIT
- AlicenseNot gradedqualityAmaintenanceTurns a codebase into a persistent knowledge graph so AI coding agents can answer structural questions about functions, call chains, routes, and cross-service links through graph queries instead of reading files one by one.MIT
- AlicenseAqualityCmaintenanceEnables AI assistants to understand and navigate codebases through structural analysis. Provides code mapping, symbol search, and impact analysis using ast-grep for accurate parsing of Python, JavaScript, TypeScript, and Go projects.452MIT
- AlicenseNot gradedqualityCmaintenanceProvides semantic code search and code insights via a knowledge graph, enabling AI to understand, navigate, and modify complex projects with deep dependency and architecture analysis.MIT
- AlicenseNot gradedqualityCmaintenanceProvides a semantic understanding of your codebase by parsing with tree-sitter and building a graph of symbols and dependencies. Enables AI assistants to navigate code, analyze changes, and discover architecture using 18 tools with minimal context overhead.3 npm1MIT
- AlicenseAqualityCmaintenanceExtracts deterministic architecture maps from codebases for AI agents, enabling queries about blast radius, routes, security findings, and production readiness without sending code anywhere.627 PyPIMIT
TDQS
Scored across 6 tools
Each tool targets a clearly distinct action: refresh builds the graph, orient gives context, find discovers nodes, read exposes source, impact computes dependencies, and trace follows cross-boundary paths. No two tools overlap in purpose, and the verbs map cleanly to separate phases of graph-assisted analysis.
All six tools use single, lowercase imperative verbs (read, refresh, find, impact, orient, trace), which is a consistent and predictable convention. There are no mixed styles or awkward noun-verb hybrids.
Six tools is well-scoped for a code-graph server; each covers a core operation (build, orient, discover, inspect, impact, trace) without redundancy. Nothing feels missing or gratuitous.
The surface covers the full analysis lifecycle: refresh builds and updates the graph, orient provides context, find locates nodes, read exposes source, impact computes blast radius, and trace follows cross-stack flows. For a read/analysis-oriented server, no create/update/delete operations are needed, and the set avoids dead ends.