obsidian-graph-traversal

obsidian-graph-traversal finds orphaned notes in an Obsidian vault by indexing wikilinks into a bidirectional in-memory graph to surface isolated content. This validates vault coherence and identifies disconnected notes for cleanup.

obsidian-graph-traversal queries multi-degree connections between Obsidian notes by building an in-memory graph index from wikilinks. This enables fast forward-link and backlink lookups to explore relationships like 2nd-degree connections.

obsidian-graph-traversal supports graph queries on large Obsidian vaults with thousands of notes by building a dynamic in-memory graph index. This quickly surfaces relationships and detects orphans without reindexing the entire vault.

Yes, you need Python 3.8+ to run Obsidian graph traversal queries. The skill uses standard library usage and obsidian-parser-based tooling described in its dependencies to index notes into a graph.

obsidian-graph-traversal is the best way to detect backlinks across an Obsidian vault, transforming static notes into a queryable bidirectional graph. This enables instant forward-link and backlink lookups to accelerate research notes interconnection.