path
Preview the shortest weighted route between two nodes to check if they are meaningfully connected before saving a recallable trail.
Instructions
Compute the shortest weighted path between two nodes WITHOUT writing anything — a preview. Edge weight is the cost, so stronger links (higher weight) make shorter paths. chain saves the same path as a recallable trail; use path to look first when you are not sure the two are meaningfully connected.
Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| to | Yes | End node name or id. | |
| from | Yes | Start node name or id. | |
| initiative | No |