Skip to main content
Glama
couzic

ts-graph-mcp

by couzic

Related Servers

Alternatives to ts-graph-mcp

No user-submitted related servers found.

    Related Servers

    • A
      license
      Not graded
      quality
      C
      maintenance
      AST-aware TypeScript/JavaScript codebase exploration for AI agents, providing high-precision symbol resolution, reference finding, and structural analysis via MCP tools.
      135 npm
      MIT
    • A
      license
      Not graded
      quality
      B
      maintenance
      Enables AI coding agents to query a local, continuously updated symbol graph of a codebase, providing ranked search, caller/callee exploration, dependency paths, and git-diff impact analysis through MCP tools.
      627 npm
      Apache 2.0
    • A
      license
      A
      quality
      B
      maintenance
      Indexes any TypeScript / React / Next.js repo into a queryable code graph and exposes 13 MCP tools — who-renders, who-calls, find-references, blast-radius, find-cycles, dead-code orphans, and local semantic search — so agents query structure instead of reading whole files. Built on ts-morph, so edges are resolved, not grepped.
      14
      2
      MIT
    • A
      license
      Not graded
      quality
      D
      maintenance
      MCP server providing 29 tools across 5 layers for semantic TypeScript/JavaScript code intelligence, enabling AI agents to find references, trace impacts, guard APIs, and explain errors without text-search false positives.
      18 npm
      1
      MIT
    • A
      license
      Not graded
      quality
      A
      maintenance
      Semantic code intelligence MCP server for TypeScript/JavaScript codebases, enabling AI agents to retrieve specific symbols, types, and relationships without reading entire files.
      20
      MIT
    • A
      license
      Not graded
      quality
      C
      maintenance
      An MCP server that provides tools to query a TypeScript/JavaScript/Vue codebase's dependency graph, enabling agents to find impacted files, hubs, orphans, and symbol relationships through natural language.
      248 npm
      MIT