Skip to content

graph_path_between

Trace how one note connects to another through the persisted link graph: the shortest chain of notes joining them, with the edge types behind each hop. Undirected by default, because a reader follows a backlink as readily as a link; directed:true answers the narrower ‘can I reach B by following links out of A’. Returns connected:false when no chain exists within your read scope.

Domain links
Scopes read:notes
Access read
Tags read-only, domain:links, links, graph
Profile core, full
Annotation Value
Read-only yes
Destructive no
Idempotent no
Accepts an idempotency key no

Idempotent is the advisory MCP idempotentHint. Destructive is also yes for a tool that asks for confirmation only on some calls.

No human confirmation is required to call this tool.

Parameter Type Required Default Description
vault string — Vault id. May be omitted when only one vault is available. length 1–64; pattern ^[a-z0-9_-]+$
from string yes — length 1–1024
to string yes — length 1–1024
directed boolean false —
Field Type Always present Description
vault string yes —
from string yes —
to string yes —
directed boolean yes —
connected boolean yes —
from_in_graph boolean yes —
to_in_graph boolean yes —
hops object[] yes —
hops[].from string yes —
hops[].to string yes —
hops[].via string[] yes —
length number | null yes —

Other tools in the links domain: find_link_cycles, find_orphans, find_unresolved_links, get_backlinks, get_link_strength, get_outgoing_links, graph_centrality, graph_communities, prune_hub_links, rewrite_link, suggest_links, vault_health_score.

Back to the tool catalog.