Explore the knowledge graph around a memory
memory_graphRead-onlyIdempotent
BFS walk from a memory node to map related concepts, supersession chains, or decision clusters. Returns neighbor nodes with typed edges. Read-only; use after searching memories to explore connections.
Instructions
BFS walk from one memory id outward, returning neighbour nodes + typed edges. Read-only. Use after memory_search to map related concepts, supersession chains, or the cluster around a decision. direction controls edge polarity (out/in/both); depth is capped at 5.
Input Schema
TableJSON Schema
| Name | Required | Description | Default |
|---|---|---|---|
| id | Yes | Memory id to use as the root of the BFS walk. | |
| depth | No | How many hops to traverse from the root (0-5). Default 2. | |
| edge_types | No | Optional whitelist of edge types to follow. Omit to follow all types. | |
| direction | No | `out` follows outgoing edges only, `in` incoming only, `both` (default) follows all. | both |
Output Schema
TableJSON Schema
| Name | Required | Description | Default |
|---|---|---|---|
| found | Yes | `true` when the root memory exists. `false` when the id was not found (in which case `root` and `edges` are absent/empty). | |
| root | No | Root node metadata; absent when `found=false`. | |
| edges | Yes | Edges discovered by the BFS walk, sorted by edge_type then by neighbour id. |