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.
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 |