jambavan_graph
Navigate the code graph to report hubs, query node relationships, and find shortest paths between symbols. Use with an index to answer code structure questions.
Instructions
Navigate the code graph built from the current index. Call jambavan_index first. action=report lists hub nodes and edge-confidence notes; action=query finds matching nodes and their BFS neighbors; action=path finds the shortest route between two symbols. Action is inferred from the arguments when omitted. Ambiguous same-name edges are excluded unless include_inferred=true.
Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| to | No | action=path: end symbol/file. | |
| from | No | action=path: start symbol/file. | |
| query | No | action=query: symbol/file text to find. | |
| action | No | Inferred from arguments when omitted. | |
| budget | No | action=query: max output tokens (default: 2000). | |
| direction | No | action=query: traverse callers, callees, or both (default: both). | |
| max_nodes | No | action=report: max hub nodes (default: 10). | |
| symbol_limit | No | Max indexed symbols to graph (default: 5000; higher costs more). | |
| include_inferred | No | Include ambiguous same-name inferred edges (default: false). |