find_connections
Discover notes linked to a given note up to three hops away, and optionally retrieve the full subgraph of all connections for deeper exploration.
Instructions
Find notes linked to (from or to) a given note, up to N hops. Optionally return the full subgraph instead of a flat list. Response is wrapped as {data, context} where context.next_actions suggests follow-ups like clustering a dense neighbourhood via detect_themes or tracing a path to the furthest neighbour via find_path_between. Broken-wikilink stub neighbours are excluded by default; pass includeStubs: true to include them.
Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| name | Yes | Starting note (path or fuzzy match). | |
| depth | No | Number of hops to traverse. Default 1, max 3. | |
| returnSubgraph | No | Return all edges in the neighborhood as a full subgraph instead of a flat list. | |
| includeStubs | No | Default `false`. Set `true` to include broken-wikilink stub neighbours (`frontmatter._stub: true`). |