Connection Path
get_connection_pathRead-onlyIdempotent
Find the shortest link path between two notes in a Markdown vault, revealing how seemingly unrelated notes connect through their link structure.
Instructions
Find the shortest connection path between two notes in the link graph.
Treats links as undirected — a link from A to B or B to A both count as a connection. Uses BFS; max_depth is clamped to [1, 10].
Useful for discovering how two seemingly unrelated notes are connected through the vault's link structure (the "six degrees of separation" for your notes).
Input Schema
TableJSON Schema
| Name | Required | Description | Default |
|---|---|---|---|
| source | Yes | Vault-relative path of the starting note (e.g. 'Ideas/spark.md'). | |
| target | Yes | Vault-relative path of the destination note. | |
| max_depth | No | Maximum number of hops to search. Default 10, max 10. | |
| wait_for_pending_writes | No | When True, wait until your recent document mutations have been applied to the index before answering, so the results reflect those changes. Use it right after modifying notes when this read must see them (e.g. right after a document mutation whose effect this read should reflect). Default False answers immediately from the current index — almost always already up to date; inspect the response's ``_meta.index_stale`` field to tell whether a write was still in flight. Bounded by a server timeout (default 60s); on timeout it answers from the current index rather than waiting longer. |
Output Schema
TableJSON Schema
| Name | Required | Description | Default |
|---|---|---|---|
No arguments | |||