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
    Not graded
    quality
    C
    maintenance
    Enables querying a TypeScript codebase's graph for call flows, type relationships, and symbol locations without reading file bodies.
    -
  • 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
    C
    maintenance
    Scans code for exposed secrets, API keys, tokens, and credentials across 69 patterns covering cloud services, AI platforms, payment providers, authentication services, and databases.
    MIT
  • 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
    A
    quality
    D
    maintenance
    Indexes a mono-repo into a knowledge graph and provides MCP tools to query code structure—packages, components, routes, HTTP calls—without file reads or grep round-trips.
    7
    22 npm
    MIT
  • A
    license
    C
    quality
    B
    maintenance
    Enables exploring a C++17 coroutine and device-domain call graph through MCP tools, providing symbol search, caller/callee queries, and neighborhood exploration of coroutine-aware codebases.
    11
    MIT
  • A
    license
    Not graded
    quality
    C
    maintenance
    Enables coding agents to query a deterministic AST knowledge graph of a codebase over MCP—finding symbols, callers/callees, dependencies, impact, and relevant tests via compact path:line JSON—so they can navigate code without grepping, embeddings, or an LLM.
    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
    B
    maintenance
    Enables Claude to turn a public or private code repository into an interactive, in-chat graph of its folders, files, classes, functions and API endpoints, including the calls, imports, tests and HTTP requests linking them, which users can pan, search, filter and click through. Provides tools for exploring a node's callers, callees and tests, searching nodes by name, path or docstring, and optionally writing the graph into Neo4j.
    MIT
  • A
    license
    Not graded
    quality
    C
    maintenance
    A function-level call-graph indexer for GDScript/Godot projects, exposed as an MCP server so AI coding assistants can answer questions like 'what calls this function?' or 'what would break if I change this signal?' without re-reading the whole codebase.
    1
    MIT
  • A
    license
    Not graded
    quality
    F
    maintenance
    Enables Claude Code to query a TypeScript dependency graph and retrieve the minimal set of files needed for code review, implementation, or debugging.
    MIT
  • A
    license
    Not graded
    quality
    D
    maintenance
    A TypeScript code graph tool with MCP integration that enables AI agents to perform semantic search and graph traversal (call graphs, paths between symbols) across a codebase.
    24 npm
    9
    MIT
  • A
    license
    Not graded
    quality
    B
    maintenance
    Turns a codebase into a queryable graph with semantic search, call graphs, and control/data flow analysis, served to AI coding agents via the Model Context Protocol.
    256 npm
    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
  • F
    license
    Not graded
    quality
    C
    maintenance
    Builds a semantic knowledge graph of C++ code and exposes 9 MCP tools for AI assistants to search classes, functions, inheritance, callers, callees, overrides, and more.
    3
    -
  • F
    license
    Not graded
    quality
    D
    maintenance
    Enables querying cross-repo code dependencies, HTTP routes, database tables, and queues via an MCP server using Cypher queries.
    -
  • A
    license
    A
    quality
    D
    maintenance
    An MCP server that provides a persistent sandbox for AI coding agents to explore codebases server-side, returning only compact summaries to reduce context consumption.
    3
    9
    MIT
  • A
    license
    Not graded
    quality
    F
    maintenance
    A powerful Model Context Protocol server that creates intelligent graph representations of your codebase with comprehensive semantic analysis capabilities, supporting 11 languages and 26 MCP methods.
    38 npm
    122
    MIT
  • A
    license
    Not graded
    quality
    D
    maintenance
    Enables seamless interaction with public or private code graphs from DeepGraph and CodeGPT to perform semantic searches and dependency analysis. It allows developers to explore architectural relationships, retrieve source code, and analyze repository structures across multiple AI assistants.
    595 npm
    401
    MIT
  • A
    license
    Not graded
    quality
    C
    maintenance
    Gives coding agents a read-only, token-budgeted code graph spanning every repository in a project: symbols, calls, imports, and cross-repo HTTP, config, and package links, each backed by file:line evidence on both sides. This lets agents trace how symbols connect across repos and determine the impact of an API change by distinguishing links that are actually used from ones that are only declared.
    534 npm
    Apache 2.0
  • A
    license
    Not graded
    quality
    C
    maintenance
    Enables AI coding assistants to query a persistent local code graph for targeted context, blast-radius analysis, and incremental updates, so they read only relevant files during reviews and large-repo workflows.
    MIT
  • A
    license
    Not graded
    quality
    C
    maintenance
    Enables authenticated, permission-bound read-only queries across registered repositories for inventory, ranking, impact analysis, tracing, and result interpretation.
    Apache 2.0
  • A
    license
    Not graded
    quality
    B
    maintenance
    Builds rich code graphs from TypeScript/NestJS codebases using AST analysis and Neo4j, enabling semantic search, natural language querying, and intelligent graph traversal to provide deep contextual understanding of code relationships and dependencies.
    369 npm
    17
    MIT
  • A
    license
    Not graded
    quality
    C
    maintenance
    Enables people and AI agents to query local code repositories as graphs through stdio MCP tools for project listing, search, dependency tracing, impact analysis, bridge detection, node inspection, bounded code reading, and optional LSP definition/reference lookups.
    MIT
  • F
    license
    Not graded
    quality
    C
    maintenance
    An experimental MCP server that compresses git commit co-change coupling graphs using the Baligács temporal clique linear spanner algorithm, reducing edge and token counts by ~55-65% while preserving temporal reachability, and exposes tools like index_repository, get_architecture, search_code, and temporal_compress for querying code knowledge graphs.
    -