A fully local, MIT-licensed tool that builds a knowledge graph of a codebase showing real call relationships, not just text matches like grep. It addresses the problem that coding agents such as Claude Code rely on grep and miss actual call sites. Built for developers on large codebases who need open licensing and no cloud upload.
Visit project ↗growmos is a tool that maintains a knowledge graph inside your repository, committed with your code. It integrates with coding agents like Claude Code, Codex, and Cursor to automatically grow the graph as they work, enabling queries about code dependencies and decisions with citations. It solves the problem of context loss in long coding sessions by providing persistent, queryable knowledge.
growmos is a tool that maintains a knowledge graph inside your repository, committed with your code. It integrates with coding agents like Claude Code, Codex, and Cursor to automatically grow the graph as they work, enabling queries about code dependencies and decisions with citations. It solves the problem of context loss in long coding sessions by providing persistent, queryable knowledge.
Kivgraph is a local, Apache-2.0 MCP server that indexes multiple repositories into a semantic code graph for LLM coding agents. It answers structural queries (callers, change impact, cross-repo consumers) directly instead of relying on long chains of grep calls and file reads. It targets developers using LLM agents on large codebases, reducing context cost and enabling provable cross-repository relationships.
Kivgraph is a local, Apache-2.0 MCP server that indexes multiple repositories into a semantic code graph for LLM coding agents. It answers structural queries (callers, change impact, cross-repo consumers) directly instead of relying on long chains of grep calls and file reads. It targets developers using LLM agents on large codebases, reducing context cost and enabling provable cross-repository relationships.
Claude Graph Brain is a local tool that creates a fast, queryable index of a git repository's structure (files, symbols, imports, call graph) and adds Claude-authored notes on code rationale. It updates automatically and works invisibly, helping Claude be more efficient when working with codebases. Semantic enrichment is triggered by Claude's stop hook, incurring a cost.
Claude Graph Brain is a local tool that creates a fast, queryable index of a git repository's structure (files, symbols, imports, call graph) and adds Claude-authored notes on code rationale. It updates automatically and works invisibly, helping Claude be more efficient when working with codebases. Semantic enrichment is triggered by Claude's stop hook, incurring a cost.
Octocode is a free, Apache-2.0 MCP server that indexes a repository once and answers structural questions for coding agents like Claude Code. It provides semantic search, an import/call graph, and signature views so the agent navigates large codebases without burning turns and context on grep-style exploration.
Octocode is a free, Apache-2.0 MCP server that indexes a repository once and answers structural questions for coding agents like Claude Code. It provides semantic search, an import/call graph, and signature views so the agent navigates large codebases without burning turns and context on grep-style exploration.
ctx is an open-source (MIT) tool that builds a queryable code graph in Rust, helping AI coding agents save context budget by efficiently navigating codebases. It supports MCP (Model Context Protocol) and was developed by Eagle-Logic with Claude's assistance.
ctx is an open-source (MIT) tool that builds a queryable code graph in Rust, helping AI coding agents save context budget by efficiently navigating codebases. It supports MCP (Model Context Protocol) and was developed by Eagle-Logic with Claude's assistance.