senkani_explore
Live
Replaces
Read ×N
Savings 90%+
Navigate a codebase via the bidirectional import/dependency graph. Returns a subgraph from a starting file — not a file list.
Signature
senkani_mcp.call(tool="senkani_explore", args={...})
Behavior
`DependencyExtractor` builds edges during indexing. Given an entry point, returns a bounded subgraph (both imports-of and imported-by) up to a depth limit. Ideal for first-contact exploration without reading every file.
Inputs
Name
Type
Default
Description
entry
string
—
File path or symbol to start from.
depth
integer
2
Hops in each direction (imports + imported-by).
limit
integer
30
Max nodes in the returned subgraph.
Output
Nodes (file paths) + edges (source, target, kind). ~500 tokens for a typical entry point.
Example
{"tool":"senkani_explore","args":{"entry":"src/server.ts","depth":2}}
Details
Graph is built from tree-sitter AST at index time; 15+ languages supply import parsers. Incremental updates via FSEvents.
See also
senkani_deps— Direct edge queries instead of a subgraph.senkani_search— Find a starting symbol first.
Source:
Sources/Indexer/DependencyExtractor.swift