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 setup22142,325 PyPI1,004MIT
- 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.306 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.30 npm121MIT
- 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
- AlicenseAqualityBmaintenanceA 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.2931,250 PyPI31,407GPL 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
- AlicenseBqualityDmaintenanceTransforms codebases into structural knowledge graphs for AI agents and developers, providing precise architectural awareness and dependency mapping.1530MIT
- 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 gradedqualityDmaintenanceProvides 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 gradedqualityDmaintenanceProvides 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.38 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.6MIT
TDQS
Scored across 6 tools
Each tool maps to a distinct operation: orient (overview/map), find (text→nodes), impact (ranked fan-out), read (source retrieval), trace (path following), refresh (build). The main blurred boundary is between `find` with `expand=true` and `impact`, and between `orient seed=` and `impact` depth-1 — both fan out over the neighborhood, and only the descriptions disambiguate them.
All six tools use short, lowercase, single-verb names with no prefixes or mixed conventions (impact, find, orient, read, refresh, trace). The pattern is predictable and readable throughout.
Six tools is tightly scoped for a code-graph engine, and each one covers a genuinely different phase of the workflow (orient → find → read/impact/trace, with refresh for maintenance). No tool feels redundant or missing from the count perspective.
The surface covers the full read-only analysis lifecycle: map the repo, locate nodes, read source, measure blast radius, trace cross-stack flows, and rebuild the graph incrementally. Minor gaps exist — no explicit node/edge inspection or metadata/stats query beyond orient's overview, and no diff-scoped entry point apart from passing multiple nodes to impact.