Find paths between two objects
get_pathsShortest relationship paths between two objects in a memory — the
one-call answer to "how are A and B connected?". start and target
accept an object id or an exact name/display name. Each returned path is a
list of steps {from, rel, direction, to}; paths are all of minimal length.
found: false with frontier_truncated: true means the search hit its
breadth cap, NOT proof the objects are disconnected. Use this instead of
chaining get_object calls hop by hop.
Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| limit | No | ||
| start | Yes | ||
| memory | Yes | ||
| target | Yes | ||
| max_depth | No |
Output Schema
| Name | Required | Description | Default |
|---|---|---|---|
No arguments | |||