get_call_chain
Finds the shortest dependency path between two symbols using breadth-first search through the code's dependency graph. Input a starting and target symbol to trace their connection.
Instructions
Shortest dependency path between two symbols (BFS through the dep graph).
Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| from_name | Yes | Starting symbol name. | |
| to_name | Yes | Target symbol name. | |
| level | No | Per-hop verbosity: 0=full (source_preview), 1=sig+file, 2=minimal name+file+line. Default 2. | |
| project | No | Project name/path (default: active). |