From hivemind
Queries a local AST-derived code graph to answer structural questions about the codebase: what calls X, what imports Y, where is Z defined, and architecture overview.
How this skill is triggered — by the user, by Claude, or both
Slash command
/hivemind:hivemind-graphThis skill is limited to the following tools:
The summary Claude sees in its skill listing — used to decide when to auto-load this skill
A deterministic, AST-derived map of the current repository — every function,
A deterministic, AST-derived map of the current repository — every function,
class, method, interface, type, enum, const, and module, plus the edges between
them (calls, imports, extends, implements, method_of). It is queried as
synthesized files under the Deeplake mount; there are no real files on disk and
no network call in the read path.
The graph builds and refreshes automatically (on Stop / SessionEnd, gated by a rate limit + git diff). You never run a build command — just read it.
Use it as a fast INDEX to locate the few files/symbols that matter, then open
them with Read to answer. It is not a substitute for the source.
Activate when the user asks a structural / relational question about the code:
pushSnapshot?" / "Who uses this function?"deeplake-pull.ts import?" / "What depends on X?"GraphSnapshot defined?" / "Find the function that handles Y."impact/<symbol> (transitive blast radius)Read on the real
source file. The graph gives location + relationships, not full source.calls/imports resolved for
named imports. For anything else, fall back to grep/read.cat ~/.deeplake/memory/graph/index.md
# Overview: node/edge counts, kind breakdown, top files by node count.
cat ~/.deeplake/memory/graph/query/<pattern> # START HERE (the 2-in-1)
# Search + expand the top matches with their 1-hop neighbors (callers,
# callees, imports, heritage). Multi-token AND: query/<a>+<b>.
cat ~/.deeplake/memory/graph/find/<pattern>
# Case-insensitive substring search on node id + label (max 50 hits).
# Prints numbered handles [1] [2] ... saved for this worktree.
cat ~/.deeplake/memory/graph/show/<handle-or-pattern>
# <handle>: a digit from a prior find/ (e.g. 3).
# <pattern>: a substring → unique node detail, or a candidate list.
# Output: the node + its 1-hop neighbors grouped by edge relation.
cat ~/.deeplake/memory/graph/neighborhood/<file>
# Every symbol in a file + its cross-file neighbors (callers/callees/imports).
cat ~/.deeplake/memory/graph/impact/<pattern>
# Transitive dependents — the blast radius of changing a symbol.
cat ~/.deeplake/memory/graph/path/<from>/<to>
# Shortest dependency path between two symbol patterns (trace a flow across files).
cat ~/.deeplake/memory/graph/layers # architectural layers / subsystems
cat ~/.deeplake/memory/graph/tour # deterministic guided walkthrough
index.md to see subsystems and the biggest files.find/<name> (or query/<name>) → pick the handle.show/<handle> / neighborhood/<file> → callers/callees, imports.path/<from>/<to>. Change impact? impact/<symbol>.source_file:line and Read it — don't answer from the graph alone.calls are resolved for
named imports (TS/JS/Python), but instance-method dispatch (obj.method()),
dynamic calls, and nested/inner functions are NOT — a zero-incoming symbol may
still be reached via one of those. Confirm in the source before calling it unused.find/ is lexical, not semantic. It matches substrings, not meaning —
find/auth won't surface login/credentials unless those strings appear in
the id/label. Try multiple keywords if the first misses.Guides collaborative design exploration before implementation: explores context, asks clarifying questions, proposes approaches, and writes a design doc for user approval.
Creates structured, bite-sized implementation plans from specs or requirements before writing code. Useful for breaking down multi-step tasks into testable steps with file structure and task boundaries.
Implements work from a spec or tickets using TDD at agreed seams, with regular typechecking and test runs, followed by code review.
npx claudepluginhub legioncodeinc/hivemind