jambavan_graph_path
Compute the shortest path between two code symbols by running BFS on extracted and inferred graph edges. Index the code base first.
Instructions
Find the shortest path between two graph nodes/symbols using BFS over extracted and inferred edges. Call jambavan_index first.
Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| to | Yes | End symbol/file query. | |
| from | Yes | Start symbol/file query. | |
| symbol_limit | No | Max indexed symbols to graph (default: 5000; higher values cost more). |