chain
Save the shortest weighted path between two nodes as an ordered, recallable reasoning trail; add a summary to label it, and reuse identical trails. Reports unconnected nodes.
Instructions
Save the shortest weighted path between two nodes as a knowledge chain — an ordered, recallable reasoning trail. Stronger links (higher link weight) make shorter paths. Pass summary to note why the trail matters (it labels the chain for later triage). Idempotent — an identical chain is reused, not duplicated. Reports if the two are unconnected.
Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| to | Yes | End node name or UUIDv7 id. | |
| from | Yes | Start node name or UUIDv7 id. | |
| name | No | Optional name for the saved chain (auto-derived from endpoints if omitted). | |
| summary | No | Optional one-line summary of why this trail matters — having traced the path, say what it captures. Becomes the chain's body so `chains` can be triaged by name + summary without reading every trail. Auto-derived if omitted. | |
| initiative | No |