aspark-graph
Related Servers
Alternatives to aspark-graph
No user-submitted related servers found.
Related Servers
- FlicenseNot gradedqualityDmaintenanceAn 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.-
- AlicenseNot gradedqualityBmaintenanceLets 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.9Apache 2.0
- AlicenseNot gradedqualityAmaintenanceEnables 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 npmMIT
- AlicenseNot gradedqualityBmaintenanceEnables 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 npmMIT
- AlicenseAqualityCmaintenanceA local knowledge graph MCP server that provides AI agents with permanent, structured memory about codebases, enabling semantic search, blast radius analysis, and convention enforcement.83MIT
- AlicenseNot gradedqualityDmaintenanceExposes code graphs across multi-program repositories via MCP, enabling humans and agents to query the fleet with evidence.MIT
TDQS
Scored across 9 tools
Each tool maps to a distinct query shape: substring search (find_nodes), id lookup (get_node), traversal (get_neighbors), pathfinding (shortest_path), freshness (staleness), invariants (gate_health), and aggregation (impact, story_trace). The main soft spot is the family of impact/story_trace/get_neighbors, which all answer variations of 'what is affected by X' at different abstraction levels; descriptions differentiate them, but an agent must read carefully to pick the right one.
Six of nine tools follow a clear verb_noun or verb pattern (build_graph, find_nodes, get_node, get_neighbors, shortest_path, story_trace) in consistent snake_case. The remaining three (impact, gate_health, staleness) are bare nouns, a minor deviation that is still readable and semantically sensible given they are report-style queries.
Nine tools is well within the ideal range and each covers a distinct graph operation: build, lookup, search, traverse, path, and four analytical reports. Nothing feels redundant or padded.
The lifecycle is well covered: the graph is built (build_graph), validated (staleness), queried at node/neighbor/path levels, and analyzed via impact, gate_health, and story_trace. Minor gaps exist — there is no explicit way to enumerate features, edge types, or the full node set without a substring, and no direct query for a story's raw acceptance-criteria records outside story_trace.