graph_path
How two entities are connected: the ordered hops of a bounded breadth-first search over ownership and control edges in both directions. ⚠️ BOUNDED, NOT EXHAUSTIVE — at most 15 edges are followed per entity, per direction, per hop, so found: false means NO PATH WAS FOUND WITHIN THOSE BOUNDS and is NOT evidence that the two entities are unconnected. The response always carries exhaustive: false; never report a negative result as a clean bill of health.
Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| to | Yes | Entity uuid. | |
| from | Yes | Entity uuid. | |
| max_depth | No | Hops, 1–4 (default 3). Depth 4 is measurably slower on densely connected entities — ask for it deliberately. |