get_neighbors
Find every note linked to a given note in the wikilink graph, up to 3 hops away, returned as a flat list of titles. Answers what a note is connected to without extra graph data.
Instructions
What is around ONE note in the [[wikilink]] graph, out to depth hops. Answers "what is this connected to" with a flat list of titles — no node indices to decode, no whole-vault payload. For the shape of that neighbourhood — which notes link to each other, not just which are near — use get_graph with root_title and depth instead; it scopes the same way and keeps the edges.
Traversal is undirected: a note linking HERE is a neighbour just as much as one linked FROM here, because "what is this connected to" means both. links_out and links_in describe the direct relation to the note you asked about, and are sent only when true — so a depth-2 row carries neither. That is not a missing value: "which way does the arrow point" has no answer two hops away. Each note appears once, at the shortest depth that reaches it, and depth: 1 means directly linked.
These are LINKS people wrote, not similarity — a note about the same subject that nobody linked is not here. get_graph's semantic_edges cover that, and search covers finding it at all. An empty result means nothing links to or from this note, which is a fact about the writing, not about the topic.
Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| id | No | ||
| depth | No | Hops to walk. 1 = directly linked notes; each extra hop widens the set fast | |
| title | No |