Skip to main content
Glama

Related Servers

Alternatives to aspark-graph

No user-submitted related servers found.

    Related Servers

    • F
      license
      Not graded
      quality
      D
      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.
      9
      Apache 2.0
    • A
      license
      Not graded
      quality
      A
      maintenance
      Enables AI coding agents to query a locally indexed structural code graph — source entities, callers/callees, Git relationships and recorded mistakes — so they retrieve focused, token-bounded context instead of reading entire files. It runs over local SQLite and can be served through a CLI, agent hooks, an MCP executable and an authenticated local dashboard.
      24 npm
      MIT
    • A
      license
      Not graded
      quality
      B
      maintenance
      Enables AI coding agents to query a local structural code graph for focused context—source entities, Git relationships, and selected project memory—instead of reading full files. It exposes graph retrieval and bounded context delivery through MCP.
      24 npm
      MIT

    TDQS

    B3.1/5.0

    Scored across 9 tools

    Disambiguation4/5

    Most tools are clearly distinct: get_node is exact-id lookup while find_nodes is substring search, and get_neighbors/impact/shortest_path are separated by adjacency vs. dependency impact vs. pathfinding. There is mild conceptual overlap between story_trace and gate_health, and between impact and get_neighbors, but the descriptions provide enough boundary clarity.

    Naming Consistency3/5

    All names use snake_case, and several follow verb_noun (build_graph, get_node, find_nodes, get_neighbors), but others are concept-noun phrases (story_trace, gate_health, impact, shortest_path, staleness). The mix is readable but not a consistent naming convention.

    Tool Count5/5

    Nine tools is a well-scoped set for a repository graph server: one write/build operation, multiple query modes, traversal, impact analysis, health checks, and staleness reporting. Each tool contributes a distinct capability without obvious bloat.

    Completeness4/5

    The surface covers the core graph lifecycle well: build/rescan, node lookup, substring search, neighbor traversal, shortest path, story tracing, gate health, impact, and repo freshness. Minor gaps exist, like no explicit raw edge listing or graph-level metadata query, but agents can complete the intended workflows.

    Maintenance

    ActivityMaintained
    ResponsivenessNo issues