
Repo Graph
This gives LLMs a structural map of your codebase so they can navigate by relationships instead of grepping blindly. It scans 20+ languages (Go, Rust, TypeScript, Python, Java, React, Angular, and more), extracts entities like functions and routes, then builds a graph of imports, calls, and cross-stack HTTP flows. The AI gets 13 tools to query it: trace a feature end to end with flow(), check blast radius with impact(), or use minimal_read() to get only the files needed for a fix. The demo shows Claude fixing a Go/Angular bug in 30 seconds instead of 4 minutes by querying the graph first. Install with pip, point it at your repo, and your assistant stops reading everything to find anything.
- GitHub stars
- 55
- tools
- 6
- transport
- STDIO
- env var
- 1
- last updated
- Nov 3, 2026
Tools
6 toolsPublic tool metadata for what this MCP can expose to an agent.
orientThe first call on a repo: node/edge counts, detected kinds, entry points, and a blind-spots note flagging which languages/edges are under-linked.
The first call on a repo: node/edge counts, detected kinds, entry points, and a blind-spots note flagging which languages/edges are under-linked.
No parameter schema in public metadata yet.
findTurn any text into the ranked nodes that matter — a symbol/keyword, or a pasted stacktrace / failing-test id / diff (resolved to the code it implicates).
Turn any text into the ranked nodes that matter — a symbol/keyword, or a pasted stacktrace / failing-test id / diff (resolved to the code it implicates).
No parameter schema in public metadata yet.
impactBlast radius: what a change affects (forward) or depends on / is used by (backward), as a ranked, located closure.
Blast radius: what a change affects (forward) or depends on / is used by (backward), as a ranked, located closure.
No parameter schema in public metadata yet.
traceOne arg: a feature end-to-end across the stack, each hop labelled with its mechanism; two args: the shortest path between two nodes.
One arg: a feature end-to-end across the stack, each hop labelled with its mechanism; two args: the shortest path between two nodes.
No parameter schema in public metadata yet.
readA node's exact source, sliced from its file by the graph's line span, plus a context footer.
A node's exact source, sliced from its file by the graph's line span, plus a context footer.
No parameter schema in public metadata yet.
refreshRebuild the graph (incremental by default — only changed files re-parse). repo_path retargets a different path or git URL; full=true forces a clean reparse.
Rebuild the graph (incremental by default — only changed files re-parse). repo_path retargets a different path or git URL; full=true forces a clean reparse.
No parameter schema in public metadata yet.
Sponsors
Configuration
REPO_GRAPH_REPOPath to the target repository to map. Alternative to --repo; takes effect when --repo is not passed.
Readme
repo-graph
Structural graph memory for AI coding assistants. Map your codebase. Navigate by structure. Read only what matters.
repo-graph gives LLMs a map of your codebase — entities, relationships, and flows — so they can navigate to the right files without reading everything first.
Instead of flooding an LLM's context window with your entire codebase (or hoping it guesses right), repo-graph builds a lightweight graph of what exists, how things connect, and where the entry points are. The LLM queries the graph, finds the minimal set of files it needs, and reads only those.
It pays off most where that's hardest to do by hand: large repos, monorepos that span several languages, and multi-service systems where a feature's path crosses files, stacks, and service boundaries. On a small single-language project a model can just read the files — see Where it fits best for the honest sweet spot.
Install in one click:
Details
- Repository
- github.com/james-chahwan/repo-graph
- Package
mcp-repo-graph- Transport
- STDIO
- Registry
- MCP registry, active