trace
Trace the shortest chain of relationships connecting two memory IDs. Returns the path, all connected edges, and notable branches to synthesize a clear narrative.
Instructions
Find the shortest chain of relationships connecting two concepts (by memory ID). Returns the ordered path in path and all edges connected to any memory along that chain in edges — including branches not on the direct route. Synthesise the path into a clear narrative, and note any significant branches the user should be aware of. Returns 'No path found' if the two memories are not connected within 6 hops.
Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| to_id | Yes | ID of the destination memory | |
| from_id | Yes | ID of the starting memory |