Skip to main content
Glama

Related Servers

Alternatives to aspark-graph

No user-submitted related servers found.

    Related Servers

    • F
      license
      Not graded
      quality
      C
      maintenance
      An in-memory knowledge graph MCP server that gives coding agents structural and semantic recall over codebases by indexing Python source, ADR documents, and project configuration, exposing 7 tools for search, traversal, context retrieval, and natural-language Q&A.
      -
    • A
      license
      Not graded
      quality
      B
      maintenance
      Lets coding agents query a hosted knowledge graph of a git repository over MCP or the shell to retrieve recorded commit intent, co-change coupling, ranked blast radius, and computed architecture. Answers are drawn from the graph rather than file reads, reporting measured per-answer token savings.
      5
      Apache 2.0
    • A
      license
      Not graded
      quality
      B
      maintenance
      Enables coding agents to query a local, multi-repo code graph for symbol exploration, blast radius analysis, co-change mining, and durable code-anchored memory via MCP tools.
      891 npm
      14
      Business Source 1.1
    • A
      license
      Not graded
      quality
      A
      maintenance
      Local repository intelligence MCP server that builds a reusable graph of code structure for AI coding agents, providing 34 network-free tools for understanding, searching, and analyzing repositories without data leaving the machine.
      40 npm
      MIT

    TDQS

    B3/5.0

    Scored across 7 tools

    Disambiguation4/5

    Most tools are sharply distinct, but impact and get_neighbors both deal with graph traversal/dependency reach, and story_trace and gate_health both surface story/acceptance-criteria information. The descriptions clear up the boundaries, so an agent can usually choose correctly.

    Naming Consistency3/5

    find_nodes and get_neighbors use a verb_noun pattern, while shortest_path, story_trace, impact, gate_health, and staleness are noun-like or noun+noun names. All names are readable and lowercase snake_case, but the conventions are mixed rather than following a single predictable pattern.

    Tool Count5/5

    Seven tools is a well-scoped size for a read-only graph query and analysis server. Each tool covers a distinct analytical need without redundancy or bloat.

    Completeness4/5

    The set covers path queries, story tracing, change impact, gate invariants, repo/graph staleness, node search, and neighborhood traversal. Minor gaps exist such as exact-ID node retrieval and edge-type filtering, but find_nodes and get_neighbors provide reasonable workarounds.

    Maintenance

    ActivitySlowing
    ResponsivenessNo issues