graph_path
Find the shortest directed relation chain between two symbols, preserving direction. Returns the path without reading intermediate files, or reports no path if unconnected.
Instructions
The shortest relation chain between two symbols, direction preserved. Answers "how does A reach B" without reading the files between. (no path found) when unconnected is an answer.
Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| to | Yes | Goal node id, label, or free text. | |
| from | Yes | Start node id, label, or free text. | |
| budget | No | Token budget for lines. |