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_graph | (Re)scan a repository and its .spark/ artifacts and persist the graph. |
| get_node | 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 |
| 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 7 tools
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.
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.
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.
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.