Skip to main content
Glama

Server Configuration

Describes the environment variables required to run the server.

NameRequiredDescriptionDefault
GRAPHVIEW_HOMENoOptional directory where graphview stores its own data (worklist history, coverage reports). Defaults to ~/.graphview.

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

CapabilityDetails
tools
{
  "listChanged": false
}
prompts
{
  "listChanged": false
}
resources
{
  "subscribe": false,
  "listChanged": false
}
experimental
{}

Tools

Functions exposed to the LLM to take actions

NameDescription
get_graphA

Subgraph as {nodes, links, meta}. Filters are optional. Above limit nodes the best-connected ones are kept (meta.sampled). Parallel links are merged into one with a count; above max_links the heaviest are kept (meta.links_truncated). Prefer search and neighbors over a wide get_graph.

get_nodeA

One node with its properties and its links grouped by link type. Each group has the real total and its max_per_type heaviest neighbours (id, label, type, count of parallel links). Use neighbors to walk further.

neighborsB

Subgraph around a node, following links in both directions up to depth. Same sampling and link merging as get_graph.

searchA

Find nodes by text in their label or properties. Best matches first.

graph_statsA

Counts by node type, link type and source, plus load warnings.

pathA

How two nodes are connected: the shortest chain of nodes between them, link direction ignored, with the typed links along it. found is false when there is no way through. Get the ids from search.

provenanceA

Where a node comes from: the chain of nodes it superseded (nearest first), the ones that superseded it, and its source rows (e.g. the episodes a fact was distilled from), when the mapping declares them.

worklistA

What in this graph probably wants fixing at its source: likely duplicates (same-type nodes with near-equal names), hubs linked to a large share of the graph (possibly generic words), islands (small groups cut off from the main body) and unlinked nodes. summary has the real totals; each list is cut to max_items.

list_typesB

Node types, link types and sources, each with its count and display colour.

reloadB

Read every source again. Returns the new stats.

open_viewerA

Open the 3D viewer in the user's browser. focus is a node id to fly to; query runs a search in the viewer. The URL works only on this machine.

Prompts

Interactive templates invoked by user choice

NameDescription

No prompts

Resources

Contextual data attached and managed by the client

NameDescription

No resources

TDQS

A3.8/5.0

Scored across 11 tools

Disambiguation5/5

Each tool has a clearly distinct purpose: opening the viewer, fetching subgraphs, getting single nodes, exploring neighbors, searching, statistics, pathfinding, provenance tracking, worklist analysis, type listing, and reloading. No overlap or ambiguity between tools.

Naming Consistency3/5

Names are all lowercase and readable, but they mix verb-noun patterns (get_graph, list_types) with standalone nouns (neighbors, path, provenance, worklist). This inconsistency could cause an agent to hesitate on the expected action, though descriptions mitigate confusion.

Tool Count5/5

11 tools is well-scoped for a graph viewer. Each tool covers a distinct aspect of graph exploration and maintenance without redundancy, and the count is neither sparse nor overwhelming.

Completeness5/5

The tool surface comprehensively covers the domain of graph viewing: browsing, searching, navigation, statistics, relationship tracing, provenance, and integrity checking. There are no obvious dead ends, and the missing CRUD operations are irrelevant since this is a read-only viewer.

Maintenance

ActivityMaintained
ResponsivenessNo issues