gograph_path
Find the shortest call chain between two symbols via BFS, tracing execution flow through the call graph. Returns a JSON with the symbol path or indicates no path exists.
Instructions
Find the shortest call chain between two symbols — BFS from from to to through the call graph. Requires .gograph/graph.json — run gograph build . first. Read-only; no side effects. WHEN TO USE: When confirming whether a handler can reach a utility function, debugging surprising call chains, or tracing execution flow between two non-adjacent symbols. NOT TO USE: For direct callers only (use gograph_callers); for all transitive upstream callers (use gograph_impact). RETURNS: JSON with from, to, found bool, and steps[] containing the symbol chain; found:false when no call path exists between the two symbols.
Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| from | Yes | The starting symbol name | |
| to | Yes | The target symbol name |