memory_graph
Map and explore connections between stored memories: find connected nodes, shortest paths, and subgraphs; infer, suggest, or explain relationships; and inspect linked entities.
Instructions
Memory association graph operations - explore connections between memories.
ACTIONS:
connected: Find memories connected via associations (BFS traversal)
path: Find shortest path between two memories
subgraph: Get graph structure around a memory for visualization
extract_entities: Manually extract and store entities for a memory (write). Params: hash (string)
infer: Find transitive relationships (A→B→C implies A→C). Params: rel_type (string), max_hops (int, default 2)
suggest: Suggest potential relationships for a memory based on shared neighbors. Params: hash (string)
abduct: Find plausible common-cause explanations for a memory's relationships. Params: hash (string)
list_entities: List known entities. Params: limit (int, default 50)
entity_profile: Show memories linked to one entity. Params: entity_name (string)
Examples: {"action": "connected", "hash": "abc123", "max_hops": 2} {"action": "path", "hash1": "abc123", "hash2": "def456", "max_depth": 5} {"action": "subgraph", "hash": "abc123", "radius": 2} {"action": "infer", "rel_type": "causes", "max_hops": 2} {"action": "suggest", "hash": "abc123"}
Tool call template
Replace each placeholder with a value matching the input schema. Only required parameters are included; add optional parameters as needed.
{
"id": 1,
"jsonrpc": "2.0",
"method": "tools/call",
"params": {
"arguments": {
"action": "<action>"
},
"name": "memory_graph"
}
}Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| hash | No | Memory hash (for connected/subgraph) | |
| as_of | No | For 'connected': point-in-time traversal (issue #1724). Only edges valid at this moment are followed (temporal edges carry valid_from/valid_until; untimed edges are always followed). Same formats as memory_search as_of. | |
| hash1 | No | Start memory hash (for path) | |
| hash2 | No | End memory hash (for path) | |
| limit | No | For 'list_entities': max entities to return | |
| action | Yes | Graph operation to perform | |
| radius | No | For 'subgraph': nodes to include | |
| max_hops | No | For 'connected': max traversal depth | |
| rel_type | No | For 'infer': relationship type to traverse | |
| max_depth | No | For 'path': max path length | |
| entity_name | No | For 'entity_profile': entity to profile |