gograph_path
Find and rank call chains between two Go symbols to confirm reachability, favoring exact, shorter, production paths, with optional Mermaid flowchart output.
Instructions
Find the best call chain from one symbol to another. Competing paths rank exact before possible, then shorter, production before tests, typed resolution before heuristics, with a deterministic canonical tie-breaker. The MCP server refreshes source analysis before the call. Read-only; no side effects. WHEN TO USE: To confirm reachability between non-adjacent symbols. NOT TO USE: For all transitive upstream callers (use gograph_impact). RETURNS: from, to, found, and steps[]; with mermaid=true, Mermaid flowchart text.
Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| to | Yes | The target symbol name | |
| from | Yes | The starting symbol name | |
| mermaid | No | Return Mermaid flowchart text instead of structured JSON |