jambavan_graph_query
Search a knowledge graph for matching nodes and traverse inbound/outbound neighbors within a set token budget. Requires prior indexing.
Instructions
Query the current knowledge graph: find matching nodes and BFS neighbors within a token budget. Call jambavan_index first. Uses extracted edges by default; set include_inferred=true to include ambiguous same-name candidates.
Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| query | Yes | Symbol/file text to find in the graph. | |
| budget | No | Max output tokens (default: 2000). | |
| direction | No | Traverse callers, callees, or both (default: both). | |
| symbol_limit | No | Max symbols in the query-focused graph neighborhood (default: 5000). | |
| include_inferred | No | Include ambiguous same-name inferred edges (default: false). |