"Dgraph" matching MCP servers:

Enables AI agents to navigate, search, and rank notes in an Obsidian vault using graph relationships, providing context-aware access to knowledge without exposing raw file contents.

Enables AI coding agents to search and read local Markdown knowledge bases generated by Agent Docs for Markdown, across single or multiple workspaces, including link/backlink discovery and index status checks.

Enables semantic search of the KJV Bible and personal knowledge graph for scripture study, notes, prayers, and memory verses, all running locally with no cloud dependencies.

Lets Claude or any MCP client query a Neo4j index of a markdown vault, answering what is connected to a note and how far, how two notes relate, which notes are orphans or dangling links, and running read-only Cypher.

A local-first Graph-RAG system combining ChromaDB with metadata-based graph relationships and Gemini 2.5 Flash for intelligent Q&A over Obsidian vaults, supporting MCP clients like Claude Desktop, Cursor, and Raycast.

Provides a self-tending knowledge base for AI agents, automatically harvesting session transcripts into facts and state notes, and injecting relevant context into new sessions via MCP hooks.

Enables agents to compile a personal knowledge vault into a linked graph by indexing bi-directional links and parsing [[wikilinks]], tags, and unlinked mentions across notes. It runs deterministically over MCP without external dependencies, turning raw note collections into navigable, queryable knowledge structures.

A FastMCP server that suggests wikilinks for Obsidian notes based on a pre-computed knowledge graph, helping surface connections while writing.

Enables AI agents to explore and analyze a markdown vault as a traversable knowledge graph, with tools for searching, traversing, and finding implicit semantic connections between notes.

Enables agents to compile a personal knowledge vault into a graph with bi-directional link indexing by parsing [[wikilinks]], tags, and unlinked mentions across notes. Runs as a zero-dependency MCP server, so MCP clients can build and query note connections deterministically without LLM round-trips.