slm-graph
Index and query a codebase as a structural graph — build the code graph, trace blast radius of a change, find callers/callees/inheritors, semantic code search…
Skill by qualixar
Install
Works with Claude Code, Claude apps, Codex, Cursor, Gemini CLI, GitHub Copilot, VS Code, OpenCode, Goose, Windsurf. Read the repository before you give any tool access to your data.
npx agentmarket install skill/qualixar-slm-graph-86a40e
Asks which of your tools to add it to (Claude Code, Codex, Cursor, VS Code, Windsurf, Gemini CLI, Claude Desktop) and shows the change first. See https://agentmart.dev/cli.
Get the weekly diff
The weekly diff: one email a week with new agent tools, notable updates and grade changes, plus security alerts for tools you follow. Double opt-in, one-click unsubscribe.
About
Use cases: writing
Reviews
Write a reviewNo reviews yet. Installed it? Reviews come from verified installers only. How reviews work
Permissions: not checked yet.
What's inside
- Skill name
slm-graph- Description
- Index and query a codebase as a structural graph — build the code graph, trace blast radius of a change, find callers/callees/inheritors, semantic code search by meaning, assemble PR review context, and detect what changed since last index. Use when the user asks how code connects, what breaks if X changes, what calls a function, what a class inherits from, how to navigate an unfamiliar codebase, or to understand risk before editing.
- License
- AGPL-3.0
- Allowed tools
- build_code_graph,, query_graph,, get_blast_radius,, semantic_search_code,, get_review_context,, detect_changes,, Bash(slm:*)
- Instructions
- 303 lines in SKILL.md · view on GitHub
Before installing
- Pre-approves some shell commands
Files (1)
- SKILL.md
SKILL.md (first lines)
# slm-graph — Code Intelligence Skill
Index any repo as a code knowledge graph and answer structural questions about it: callers, callees, impact radius, semantic search, and review context. These tools are not in the default tool set: they need `slm tools set code` (or `whole`); see "Tool set requirement" below.
**Prerequisite rule:** every tool except `build_code_graph` self-guards — if the graph is not built it returns `{"success": false, "error": "Code graph not built. Run build_code_graph first."}`. Always index first.
---
## Tool Reference
### 1. `build_code_graph` — index a repository
```
build_code_graph(
repo_path: str,
languages: str = "",
exclude_patterns: str = "",
) -> {success, files_parsed, nodes, edges, flows, communities, duration_ms}
```
Parses all supported source files, extracts functions/classes/imports, builds the call graph, detects execution flows, and identifies code communities. Replaces any previous index for the same repo.
- `repo_path` — absolute path to the repository root. Must exist and sit under your home directory; a path outside it is refused with `Invalid repo_path`.
- `languages` — comma-separated language filter, e.g. `"python,typescript"`. Empty string = index all supported languages.
- `exclude_patterns` — comma-separated glob patterns to exclude, e.g. `"**/node_modules/**,**/.venv/**"`. Empty = no exclusions.
When to (re)build:
- Before using any other graph tool for the first time on a repo.
- After significant changes to the codebase (pull, merge, large refactor).
- When `detect_changes` or `query_graph` returns stale/unexpected results.
- Rebuild is safe and idempotent — it replaces the previous index atomically per file.
```
# Index the full repo
build_code_graph(repo_path="/abs/path/to/myrepo")
# Index only Python, skip tests and generated code
build_code_graph(
repo_path="/abs/path/to/myrepo",
languages="python",
exclude_patterns="**/tests/**,**/generated/**"
)
```
---
### 2. `query_graph` — traverse relationships
```
query_graph(
pattern: str,
target: str = "",
limit: int = 20,
) -> {success, pattern, target, results: [{qualified_name, kind, file_path, name}]}
```
Query the graph for structural relationships. `pattern` is required and must be one of the eight valid values below. `target` is a qualified name, partial name, or node ID — matched with exact-then-LIKE fallback.
Valid patterns:
| pattern | returns |
|---|---|
| `callers_of` | functions/methods that call `target` |
| `callees_of` | functions/methods that `target` calls |
| `imports_of` | modules/symbols that `target` imports |
| `imported_by` | who imports `target` |
| `tests_for` | test nodes associated with `target` |
| `inherits_from` | base classes of `target` |
| `inherited_by` | subclasses of `target` |
| `contains` | symbols defined inside `target` (e.g. methods in a class) |
```
# Who calls the auth handler?
query_graph(pattern="callers_of", target="authenticate_user")
# What does the payment processor import?
query_graph(pattern="imports_of", target="PaymentProcessor", limit=30)
# What classes inherit from BaseModel?
query_graph(pattern="inherited_by", target="BaseModel")
```
---
### 3. `get_blast_radius` — impact analysis
```
get_blast_radius(
changed_files: str,
max_depth: int = 2,
max_nodes: int = 500,
) -> {success, changed_nodes, impacted_nodes, impacted_files, edges, depth_reached, truncated}
```
Computes the full impact radius for one or more changed files using bidirectional BFS (callers and callees). Returns every node and file reachable within `max_depth` hops. Use this before editing to understand risk surface.
- `changed_files` — comma-separated file paths relative to the repo root, e.g. `"src/auth/handler.py,src/auth/models.py"`.
- `max_depth` — BFS depth. Default 2. Increase to 3–4 for deep call chains; lower to 1 for a quick first-degree check.
- `max_nodes` — caps the result set. If `truncated=true` in the response, the real blast radius is larger.
```
# What breaks if I change the auth handler?
get_blast_radius(changed_files="src/auth/handler.py")
# Deeper analysis across two files
get_blast_radius(
changed_files="src/payments/gateway.py,src/payments/models.py",
max_depth=3,
max_nodes=200
)
```
If `truncated` is `true`, narrow the scope with `max_nodes` or reduce `max_depth` to get a reliable result.
---
### 4. `semantic_search_code` — find code by meaning
```From qualixar/superlocalmemory, AGPL-3.0.
More from qualixar/superlocalmemory
- 0.683score
superlocalmemory-web
qualixar
Use the user's SuperLocalMemory through Web access.
SkillAFreshness: A★ 257Claude Code +9 - 0.683score
slm-bot-memory
qualixar
Cross-bot memory on a shared computer (Grok Bot, Cursor plugin, any host where several agents share one machine).
SkillAFreshness: A★ 257Claude Code +9 - 0.683score
slm-cache
qualixar
KV cache for repeated reads — call slm_cache_get(key) first; on a miss do the expensive operation then slm_cache_set(key, value, ttl_seconds) to store it; on…
SkillAFreshness: A★ 257Claude Code +9 - 0.683score
slm-compress
qualixar
Compress large text, tool output, or transcripts to reduce context-window usage while keeping the full 1M window intact — call slm_compress(content, mode…
SkillAFreshness: A★ 257Claude Code +9 - 0.683score
slm-session
qualixar
Manage SuperLocalMemory session lifecycle — call session_init once at the start of every fresh session to load relevant project context and get a session_id…
SkillAFreshness: A★ 257Claude Code +9 - 0.683score
slm-status
qualixar
Health and optimization stats for SuperLocalMemory — call slm_optimize_stats() for live compression and cache counters (compress_runs, tokens_saved_compress…
SkillAFreshness: A★ 257Claude Code +9 - 0.683score
slm-web-access
qualixar
Set up and troubleshoot SuperLocalMemory Web access, the optional link that lets web apps (ChatGPT, Claude on the web, Muse, Composio, other remote MCP…
SkillAFreshness: A★ 257Claude Code +9 - 0.683score
slm-governance
qualixar
Governed-workspace behavior for SuperLocalMemory.
SkillAFreshness: A★ 257Claude Code +9 - 0.683score
slm-graph
qualixar
Index and query a codebase as a structural graph — build the code graph, trace blast radius of a change, find callers/callees/inheritors, semantic code search…
SkillAFreshness: A★ 257Claude Code +9 - 0.683score
slm-loop
qualixar
Gate-verified bounded loops with SuperLocalMemory as the durable ledger.
SkillAFreshness: A★ 257Claude Code +9 - 0.683score
slm-media
qualixar
Save pictures and PDFs in SuperLocalMemory and find them again by describing them.
SkillAFreshness: A★ 257Claude Code +9 - 0.683score
slm-mesh
qualixar
Cross-session peer coordination via the SLM mesh network.
SkillAFreshness: A★ 257Claude Code +9
Signals
- Stars
- 257
- Forks
- 36
- Open issues
- 3
- Contributors
- 13
- Last commit (this folder)
- Oct 22, 2026 (6 days ago)
- Last release
- Oct 22, 2026 (6 days ago)
From GitHub (fetched Oct 24, 2026).
Details
- License
- AGPL-3.0
- Repository
- github.com/qualixar/superlocalmemory
- Website
- www.superlocalmemory.com
- First seen
- Oct 24, 2026
- Last checked
- Oct 24, 2026
- Source
- GitHubgithub-graphql
Same skill elsewhere
Copies of this SKILL.md published by others; search shows only one of them.
- 0.683score
slm-graph
qualixar
Index and query a codebase as a structural graph — build the code graph, trace blast radius of a change, find callers/callees/inheritors, semantic code search…
SkillAFreshness: A★ 257Claude Code +9 - 0.356score
slm-graph
qualixar
Index and query a codebase as a structural graph — build the code graph, trace blast radius of a change, find callers/callees/inheritors, semantic code search…
SkillAFreshness: A★ 257Claude Code +9 - 0.356score
slm-graph
qualixar
Index and query a codebase as a structural graph — build the code graph, trace blast radius of a change, find callers/callees/inheritors, semantic code search…
SkillAFreshness: A★ 257Claude Code +9 - 0.356score
slm-graph
qualixar
Index and query a codebase as a structural graph — build the code graph, trace blast radius of a change, find callers/callees/inheritors, semantic code search…
SkillAFreshness: A★ 257Claude Code +9 - 0.356score
slm-graph
qualixar
Index and query a codebase as a structural graph — build the code graph, trace blast radius of a change, find callers/callees/inheritors, semantic code search…
SkillAFreshness: A★ 257Claude Code +9 - 0.356score
slm-graph
qualixar
Index and query a codebase as a structural graph — build the code graph, trace blast radius of a change, find callers/callees/inheritors, semantic code search…
SkillAFreshness: A★ 257Claude Code +9 - 0.356score
slm-graph
qualixar
Index and query a codebase as a structural graph — build the code graph, trace blast radius of a change, find callers/callees/inheritors, semantic code search…
SkillAFreshness: A★ 257Claude Code +9
More from qualixar
- 0.683score
slm-graph
qualixar
Index and query a codebase as a structural graph — build the code graph, trace blast radius of a change, find callers/callees/inheritors, semantic code search…
SkillAFreshness: A★ 257Claude Code +9 - 0.683score
slm-cache
qualixar
KV cache for repeated reads — call slm_cache_get(key) first; on a miss do the expensive operation then slm_cache_set(key, value, ttl_seconds) to store it; on…
SkillAFreshness: A★ 257Claude Code +9 - 0.683score
slm-compress
qualixar
Compress large text, tool output, or transcripts to reduce context-window usage while keeping the full 1M window intact — call slm_compress(content, mode…
SkillAFreshness: A★ 257Claude Code +9 - 0.683score
slm-bot-memory
qualixar
Cross-bot memory on a shared computer (Grok Bot, Cursor plugin, any host where several agents share one machine).
SkillAFreshness: A★ 257Claude Code +9 - 0.683score
slm-governance
qualixar
Governed-workspace behavior for SuperLocalMemory.
SkillAFreshness: A★ 257Claude Code +9 - 0.683score
slm-loop
qualixar
Gate-verified bounded loops with SuperLocalMemory as the durable ledger.
SkillAFreshness: A★ 257Claude Code +9
Cite this page
slm-graph skill. Agent Mart. https://agentmart.dev/skills/qualixar-slm-graph-86a40e (last updated 2026-10-24)