jambavan_graph_path
Find the shortest path between two symbols or files in a code graph using breadth-first search. Requires the graph index to be built first.
Instructions
Find the shortest path between two graph nodes/symbols using BFS over extracted edges. Call jambavan_index first. Set include_inferred=true to opt into ambiguous same-name edges.
Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| to | Yes | End symbol/file query. | |
| from | Yes | Start symbol/file query. | |
| symbol_limit | No | Max symbols in the query-focused graph neighborhood (default: 5000). | |
| include_inferred | No | Include ambiguous same-name inferred edges (default: false). |