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
- 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.82MIT
- AlicenseNot gradedqualityBmaintenanceExposes code graphs across multi-program repositories via MCP, enabling humans and agents to query the fleet with evidence.MIT
- AlicenseNot gradedqualityBmaintenanceEnables 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.143 npm14Business Source 1.1
- AlicenseNot gradedqualityAmaintenanceLocal 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.60 npmMIT
TDQS
Scored across 9 tools
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.
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.
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.
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.