wiki-neighborslisted

# wiki-neighbors Look up the neighbourhood of **one page** directly from the persisted knowledge graph — no page-body scraping, no LLM synthesis. This is a deterministic graph lookup: give a page, get back the pages it cites (`forward`), the pages that cite it (`backward`, i.e. backlinks), or both. Reference: [[page-neighbors-roadmap]] item W-A. ## Pre-condition The knowledge graph must exist: `wiki-meta/graph/knowledge-graph.json`. If the tool call fails with "No knowledge graph at ...", tell the user and offer to run `/wiki-graph` first (or run it yourself if they confirm), then retry. ## Steps ### 1. Parse the request - `page` (required) — a page name, a unique path suffix, or the exact vault-relative path. If the user only names a topic loosely ("what links to the OAuth page"), use their best guess as `page`; the tool's own resolver will refuse with candidates if it's ambiguous (see step 3). - `direction` (optional, default `both`) — infer from phrasing: "what links TO X" / "backlinks of X" → `backward`; "what does X link to" / "what X cites" → `forward`; "neighbours of X" / "what's connected to X" → `both`. - `depth` (optional, default 1) — "direct neighbours" → 1; "neighbours of neighbours" / "2 hops" → 2. Cap at 4 — if the user asks for more, tell them 4 is the ceiling and explain why (graph fan-out grows fast). - `nodeTypes` (optional, default `["article"]`) — pages only by default. If the user asks "what concepts does X mention" or "what does X cite as a source