wiki-pathlisted

# wiki-path Find the shortest chain of links between **two named pages**, read directly from the persisted knowledge graph — "the brain's GPS". Deterministic graph lookup, no LLM synthesis. Reference: [[page-neighbors-roadmap]] item W-B. ## Pre-condition The knowledge graph must exist: `wiki-meta/graph/knowledge-graph.json`. If the tool call fails with "No knowledge graph at ...", offer to run `/wiki-graph` first, then retry. ## Steps ### 1. Parse the request - `from`, `to` (both required) — page names, unique path suffixes, or exact vault-relative paths. - `maxDepth` (optional, default 6, cap 20) — only raise this if the user explicitly asks for a deeper search; the default is generous for most vaults. - `nodeTypes` — default `["article"]` (path runs through pages only). If the user's phrasing suggests they want "how are these related through a shared idea" (e.g. two pages with no obvious direct link but a common theme), pass `nodeTypes: ["article", "entity", "topic"]` to allow bridging through a shared concept or index topic — but only after a default-mode search comes back empty, or if the user explicitly asks for "concept" / "topic" bridging up front. ### 2. Call the tool ``` mcp__obsidian-router__wiki_path({ vault, from, to, maxDepth?, nodeTypes?, edgeTypes? }) ``` ### 3. Handle the outcomes - **Graph missing** → offer `/wiki-graph`, then retry. - **Ambiguous `from`/`to`** (error lists candidates) → show the candidates, ask the user to pick. - **Endpoint not fo