aspark-graph
Server Configuration
Describes the environment variables required to run the server.
| Name | Required | Description | Default |
|---|---|---|---|
No arguments | |||
Instructions
Guidance the server publishes about itself, which clients place ahead of the tool catalog so the model reads it before choosing anything.
This server publishes no instructions, or was last inspected before Glama recorded them.
Capabilities
Features and capabilities supported by this server
Protocol revision2025-11-25
| Capability | Details |
|---|---|
| tools | {
"listChanged": false
} |
| prompts | {
"listChanged": false
} |
| resources | {
"subscribe": false,
"listChanged": false
} |
| experimental | {} |
Tools
Functions exposed to the LLM to take actions
| Name | Description |
|---|---|
| build_graphA | (Re)scan a repository and its .spark/ artifacts and persist the graph. Writes /.aspark-graph/ — this is the one MCP tool that writes. |
| get_nodeB | Look up a single node by its id (e.g. 'file:src/foo.py'). |
| story_traceB | Full thread of a user story: acceptance criteria (with their latest QA verdict), mapped plan tasks, and any best-effort code links. |
| impactA | Blast radius of a change: the stories and acceptance criteria that depend
on the given files (or the files in a git Prefer |
| gate_healthC | The aSPARK gate invariants as data: orphan tasks, unverified acceptance criteria, and open findings for a feature. |
| stalenessC | Report whether the built graph still matches the repo on disk (US-4). |
| find_nodesC | Find nodes whose id or name contains a substring, optionally by type. |
| get_neighborsC | Nodes within |
| shortest_pathC | An ordered path connecting two nodes, or an explicit 'no path' result. |
Prompts
Interactive templates invoked by user choice
| Name | Description |
|---|---|
No prompts | |
Resources
Contextual data attached and managed by the client
| Name | Description |
|---|---|
No resources | |
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.