graph_path
Find a path between two entities in a memory graph, using optional time, project, namespace, direction, and depth constraints.
Instructions
Find a bounded directed/undirected path within one scope and temporal snapshot.
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": {
"source_entity_id": "<source_entity_id>",
"target_entity_id": "<target_entity_id>"
},
"name": "graph_path"
}
}Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| at | No | ||
| project | No | ||
| direction | No | both | |
| max_depth | No | ||
| max_nodes | No | ||
| namespace | No | ||
| source_entity_id | Yes | ||
| target_entity_id | Yes |