between
Check whether two memory nodes are connected and how: lists every typed edge in both directions at the current time.
Instructions
Show every edge between two nodes, both directions, at NOW — answers "are A and B connected, and how?". Edges are typed (refers_to, causal, derived_from, contradicts, part_of, blocks, targets, supersedes, verifies, falsifies, temporal), so the answer says what KIND of connection it is. path finds a route when there is no direct edge; drill lists neighbours rather than edges.
Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| a | Yes | First node name (also accepts a UUIDv7 id). | |
| b | Yes | Second node name (also accepts a UUIDv7 id). | |
| initiative | No |