get_call_chain
Find the shortest call chain between two symbols using BFS on the dependency graph. Output with configurable verbosity levels.
Instructions
Shortest dependency path between two symbols (BFS through the dep graph).
Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| 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). | |
| to_name | Yes | Target symbol name. | |
| from_name | Yes | Starting symbol name. |