neighbours
Discover every direct connection to a memory, in both directions across all edge types, to see contradictions, supersessions, and causal links.
Instructions
List every node ONE HOP from a node, in BOTH directions, across ALL edge types — the way to discover what a memory is connected to. drill follows only derived_from and part_of; this follows all twelve (refers_to, contradicts, supersedes, causal, temporal, blocks, targets, verifies, falsifies, part_of, derived_from, consolidated_to), so a contradiction or a supersession shows up here even when drill reports nothing. Each line names the edge TYPE and which way it points: —[type]→ outgoing, ←[type]— incoming. Optional edge_type (one or more, comma-separated) narrows to certain types; omit for all. between a b answers about a specific PAIR; drill shows the derived_from/part_of tree.
Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| name | Yes | Node name or UUIDv7 id whose neighbours to list. | |
| edge_type | No | Optional edge-type filter — one or more, comma-separated; omit for ALL types. Closed vocabulary: `refers_to`, `derived_from`, `supersedes`, `causal`, `temporal`, `contradicts`, `part_of`, `blocks`, `targets`, `verifies`, `falsifies`, `consolidated_to`. Snake_case or kebab-case. | |
| initiative | No |