Skip to main content
Detect circular internal-link chains (a -> b -> … -> a) in the readable note graph. Returns up to limit cycles as ordered path lists. Loops shorter than min_length links (default 3, which skips a note and the index it links back to) are skipped, as are loops longer than max_length. folder limits the cycle members to one folder.

Annotations

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)

No human confirmation is required to call this tool.

Input

Output

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.