shadowgraph_traverse
Walk relationship links from an entity ID to reveal connected memory nodes within a project and scope.
Instructions
Walk relationships outward from one entity id and return what is reached. Find ids first with shadowgraph_search or shadowgraph_recall; shadowgraph_retrieve searches content and adds neighbours. Reads only. Memory outside the requested project and scope stays hidden.
Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| id | Yes | Entity id to start from. Must exist. | |
| depth | No | How many relationship hops to follow, 1-10. Defaults to 1. Anything outside the range is rejected. | |
| scope | No | Scope selector. Omitted or partial fields mean explicit nulls, not "any": identity is the exact (project, userId, agentId, runId, memoryType, key) tuple, so a run-scoped memory never leaks into a user-only read. | |
| project | No | Project whose memory nodes are visible during the walk. Defaults to "default"; decisions, facts, and attempts are not filtered by it. | |
| relation | No | Follow only relationships with this exact name. Omit to follow all of them. | |
| direction | No | out follows relationships whose from is in the frontier, in follows their to, both follows either. Defaults to both. |
Output Schema
| Name | Required | Description | Default |
|---|---|---|---|
| root | Yes | The entity the walk started from. | |
| depth | Yes | The hop limit that was applied. | |
| nodes | Yes | Entities reached, root first. Mixed kinds, including alternatives synthesised from their decision. | |
| direction | Yes | The direction that was applied. | |
| relations | Yes | Relationships traversed. Named relations, not "edges". |