memory_graph
Explore an entity's graph neighborhood with nodes, typed edges, and canonical facts. Find shortest paths between entities and filter relations by substring.
Instructions
Read an entity's graph neighborhood: nodes, typed edges, and each
node's canonical facts. Transitive/inverse edges arrive pre-derived
(marked derived: true with rule provenance). Pass to for the
shortest path between two entities; relation_filter keeps only
edges whose relation contains the substring.
Args: depth: Hops from the root (default 1, max 3).
Returns: {found, entity, nodes, edges, paths}.
Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| to | No | ||
| depth | No | ||
| entity | Yes | ||
| include_facts | No | ||
| relation_filter | No |
Output Schema
| Name | Required | Description | Default |
|---|---|---|---|
No arguments | |||