find_link_cycles
Detect circular internal-link chains (a -> b -> … -> a) in the readable note graph. Returns up to limit cycles as ordered path lists.
| Domain | links |
| Scopes | read:notes |
| Access | read |
| Tags | read-only, domain:links |
| Profile | full only |
Annotations
Section titled “Annotations”| 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.
Confirmation (human in the loop)
Section titled “Confirmation (human in the loop)”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_-]+$ |
|
limit |
integer |
10 |
range 1–1000 | |
max_length |
integer |
10 |
range 2–1000 |
Output
Section titled “Output”| Field | Type | Always present | Description |
|---|---|---|---|
warnings |
object[] |
— | |
warnings[].path |
string |
with parent | — |
warnings[].reason |
enum |
with parent | One of: "frontmatter_yaml" |
warnings[].message |
string |
with parent | — |
warnings_omitted |
integer |
range ≥ -9007199254740991 | |
vault |
string |
yes | — |
total |
number |
yes | — |
cycles |
string[][] |
yes | — |
skipped_longer |
integer |
yes | range ≥ -9007199254740991 |
Related tools
Section titled “Related tools”Other tools in the links domain: find_orphans, find_unresolved_links, get_backlinks, get_link_strength, get_outgoing_links, graph_centrality, graph_communities, graph_path_between, prune_hub_links, rewrite_link, suggest_links, vault_health_score.
Back to the tool catalog.