Connection Path
get_connection_pathFind the shortest path between two notes in the vault's link graph. Trace how notes are connected through their links.
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
| 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 | Wait for recent index writes. On timeout, answer from the current index with _meta.index_stale=true. Default false. |
Output Schema
| Name | Required | Description | Default |
|---|---|---|---|
No arguments | |||