BFS and DFS graph traversal in C — adjacency list, Eulerian verification, 72-test suite. Based on Cormen's Introduction to Algorithms Ch. 22. BFS and DFS graph traversal in C — adjacency list, ...

Your vault has a graph. But you can only stare at it. Obsidian's graph view is beautiful, but it can't answer questions — "Which notes have the most links?" "How many hops between these two concepts?" ...