Skip to main content
Glama
121,183 servers. Updated

Matching MCP tools:

Matching MCP Connectors:

"Free Network Graph Visualization Tools (No Account Required)" matching MCP servers:

GET /v1/servers – MCP directory API reference
  • A
    license
    A
    quality
    B
    maintenance
    Self-hosted personal knowledge graph for Claude that persists across sessions, devices, and tools. Built on Neo4j with local semantic embeddings; OAuth 2.1 lets Claude Code, Claude Desktop, and claude.ai web all hit the same graph.
    24
    132 npm
    2
    MIT
  • A
    license
    A
    quality
    C
    maintenance
    Enables Claude Code and other MCP clients to query a local, explainable knowledge graph of a codebase: answering questions, explaining symbols, tracing paths between them, and computing blast-radius impact, with every edge backed by file:line evidence. Read-only and fully offline — no network calls, telemetry, or runtime dependencies.
    5
    1
    MIT
  • A
    license
    Not graded
    quality
    B
    maintenance
    Exposes a federated, typed knowledge graph to AI clients, letting agents traverse nodes and relationships while scope-based access rights are checked on every hop and provenance is tracked for each fact. This keeps shared knowledge consistent across teams while keeping private and team-scoped content out of reach of unauthorized consumers.
    1
    Apache 2.0
  • A
    license
    Not graded
    quality
    D
    maintenance
    A knowledge graph MCP server that indexes your codebase into a local SQLite graph and provides tools for project mapping, file summaries, and impact analysis, drastically reducing token usage in AI coding assistants.
    MIT
  • A
    license
    Not graded
    quality
    C
    maintenance
    A local knowledge graph of your codebase for Claude Code on macOS, exposing structural data via MCP tools for querying calls, imports, test coverage, and impact analysis.
    90 PyPI
    1
    MIT
  • A
    license
    Not graded
    quality
    B
    maintenance
    Enables agents to route spoken requests to the right project on the right machine and to remember the outcome by reading and writing a FalkorDB graph, so learned aliases, clarification answers, and episodes carry over across sessions. Exposes five fixed, validated graph tools — route_request, whats_running, machine_blast_radius, project_history, and why_heard — each answering with its MATCH path, Cypher, and parameters, and reporting not-in-graph or ambiguous names distinctly instead of guessing.
    MIT
  • A
    license
    A
    quality
    D
    maintenance
    Exposes a dependency graph of strategic sourcing artifacts and analyses as an MCP server, enabling navigation of phases, analyses, deliverables, and graph traversal for impact analysis and build order.
    16
    Apache 2.0
  • A
    license
    Not graded
    quality
    C
    maintenance
    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.
    MIT
  • A
    license
    Not graded
    quality
    C
    maintenance
    A knowledge graph MCP server providing persistent, structured memory for AI assistants with multi-agent isolation, tiered search, and index navigation.
    5 npm
    MIT
  • A
    license
    Not graded
    quality
    B
    maintenance
    Provides AI coding agents with a local knowledge-graph memory, enabling cross-project retrieval via PageRank diffusion and tools to retrieve, write, extract, update, and view recent knowledge over MCP.
    MIT
  • A
    license
    Not graded
    quality
    C
    maintenance
    Provides a decision memory layer for codebases, enabling AI agents to search, retrieve, and record business decisions with metadata filters and full-text search.
    1
    MIT
  • A
    license
    Not graded
    quality
    A
    maintenance
    A high-performance code knowledge graph server implementing MCP, indexing codebases into a structured AST knowledge graph with semantic search, call graph traversal, and HTTP route tracing.
    3,102 npm
    96
    MIT
  • A
    license
    Not graded
    quality
    C
    maintenance
    Enables fast, targeted queries against an Obsidian vault knowledge graph using tools like search, neighbor traversal, and pathfinding, without needing to load the full graph into LLM context.
    3
    MIT
  • A
    license
    Not graded
    quality
    D
    maintenance
    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.
    MIT
  • A
    license
    Not graded
    quality
    B
    maintenance
    Enables MCP clients such as Claude Desktop, Cursor, Zed, and Windsurf to recall associative context from a folder of markdown notes, combining vector search entry points with one-hop [[wikilink]] graph expansion and cross-encoder reranking over a single SQLite file. It also appends a zero-token per-turn ledger of asks, files, tools, and decisions that agents can consult across sessions.
    253 PyPI
    15
    MIT
  • A
    license
    Not graded
    quality
    C
    maintenance
    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.
    MIT
  • A
    license
    Not graded
    quality
    B
    maintenance
    Graph-relational memory MCP server for persistent LLM memory, featuring wikilinks, BM25 auto-linking, spreading activation, and synaptic decay across five memory layers.
    MIT
  • A
    license
    Not graded
    quality
    B
    maintenance
    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.
    4
    MIT
  • A
    license
    Not graded
    quality
    B
    maintenance
    Enables AI agents to store, query, and trace a time-aware memory graph of nodes and edges in a single SQLite file, supporting weighted recall, temporal queries, and provenance-aware writes over MCP.
    5 npm
    1
    MIT
  • A
    license
    Not graded
    quality
    B
    maintenance
    Serves approved lessons learned from past corrections to coding agents, delivering task context and file-scoped lessons before work starts and checking finished work against them before the agent declares done. It also exposes module facts, dependency impact, and past misses tied to specific files.
    9 npm
    Apache 2.0
  • A
    license
    Not graded
    quality
    C
    maintenance
    Enables AI coding agents to store and query procedural knowledge as RDF triples, returning localized guidance, ranked next steps, and fastest successful paths while recording transition outcomes and task rollouts. Supports self-evolving graph maintenance through proposed mutations, held-out validation gating, negative memory of rejected proposals, and idempotent evidence imports.
    MIT
  • A
    license
    Not graded
    quality
    D
    maintenance
    Enables coding agents to query a temporal knowledge graph derived from a beads issue tracker via read-only Cypher queries, exposing current rules, supersession chains, and provenance without LLM API keys.
    MIT
  • A
    license
    Not graded
    quality
    C
    maintenance
    Enables MCP-capable agents to query a fine-grained computer-science exam knowledge-point graph, map questions to knowledge points, diagnose broken cross-subject links and weak areas, retrieve reviewed analogies, and import user-supplied exam PDFs into a traceable question bank.
    MIT
  • F
    license
    Not graded
    quality
    C
    maintenance
    Enables AI assistants like Claude to read and write contacts, relationships, and interactions in a personal CRM via a graph-based API.
    -
  • F
    license
    Not graded
    quality
    C
    maintenance
    Enables Claude to recall and query past conversations through a local knowledge graph and vector index, with tools for searching memory, retrieving related entities, and adding new memories.
    1
    -