find_path_between
Finds all simple link paths between two notes, with configurable depth and optional inclusion of shared neighbors or stub nodes.
Instructions
Find link paths between two notes. Returns all simple paths up to maxDepth edges, optionally including their shared neighbors. Broken-wikilink stub nodes are excluded by default — they are degree-1 dead ends in the undirected graph and will block legitimate paths if left in. Pass includeStubs: true to include them.
Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| from | Yes | Source note (path or fuzzy match). | |
| to | Yes | Target note (path or fuzzy match). | |
| maxDepth | No | Maximum path length in hops. Default 3. | |
| includeCommon | No | Also return notes that both `from` and `to` link to (shared neighbors). | |
| includeStubs | No | Default `false`. Set `true` to include broken-wikilink stub nodes (`frontmatter._stub: true`) in the path search. |