trace
Discover the shortest chain of relationships connecting two concepts by their node IDs. Returns the ordered path and all edges, synthesizing a narrative of the connection and noting significant branches.
Instructions
Find the shortest chain of relationships connecting two concepts (by node ID). Returns the ordered path in path and all edges connected to any node 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 nodes are not connected within 6 hops.
Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| from_id | Yes | ID of the starting node | |
| to_id | Yes | ID of the destination node |