find_symbol_path
Find the shortest call-graph path between two symbols, crossing service boundaries via the organization graph. Prioritizes core entry-point symbols using weighted Dijkstra.
Instructions
Find the shortest call-graph path between two symbols, crossing service boundaries via the org graph when needed.
Uses weighted Dijkstra (w=1.0→cost 1, w=0.75→1.3, w=0.5→2.0, cross-service org edge→5) to prefer traversal through core entry-point symbols over indirect paths.
from_symbol : Name of the source symbol. to_symbol : Name of the destination symbol. from_repo : Absolute path to source repo (auto-detected if omitted). to_repo : Absolute path to destination repo (auto-detected if omitted).
Returns {path, hops, crosses_services, services_traversed} or {error}.
Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| from_symbol | Yes | ||
| to_symbol | Yes | ||
| from_repo | No | ||
| to_repo | No |