trace
Find the shortest chain of relationships connecting two concepts and synthesize the path into a clear narrative, noting any significant branches.
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 |
|---|---|---|---|
| from_id | Yes | ID of the starting memory | |
| to_id | Yes | ID of the destination memory |