Skip to main content
Glama

mst_find

Read-onlyIdempotent

Computes the minimum spanning tree of a weighted graph using Kruskal's algorithm, helping you identify the lowest-cost set of edges that connects all nodes.

Instructions

Find the minimum spanning tree of a weighted graph using Kruskal's algorithm.

Input Schema

NameRequiredDescriptionDefault
edgesYesArray of weighted edges

Schema Changelog

Changes observed during successful MCP inspections.

  1. Addedv0.1.11

TDQS

B3.3/5.0
Behavior3/5

Does the description disclose side effects, auth requirements, rate limits, or destructive behavior?

Annotations already declare readOnlyHint=true, idempotentHint=true, destructiveHint=false, and openWorldHint=true, so the safety profile is covered. The description adds the specific algorithm (Kruskal's), which is useful behavioral context, but does not disclose handling of disconnected graphs, duplicate edges, or the return shape.

Agents need to know what a tool does to the world before calling it. Descriptions should go beyond structured annotations to explain consequences.

Conciseness5/5

Is the description appropriately sized, front-loaded, and free of redundancy?

A single, front-loaded sentence with no wasted words. It efficiently conveys the operation, input, and algorithm.

Shorter descriptions cost fewer tokens and are easier for agents to parse. Every sentence should earn its place.

Completeness3/5

Given the tool's complexity, does the description cover enough for an agent to succeed on first attempt?

For a simple one-parameter algorithm tool, the core purpose is covered, but there is no output schema and the description does not explain what is returned (e.g., MST edges or total weight) or how disconnected graphs are handled. These are meaningful gaps for an agent invoking the tool.

Complex tools with many parameters or behaviors need more documentation. Simple tools need less. This dimension scales expectations accordingly.

Parameters3/5

Does the description clarify parameter syntax, constraints, interactions, or defaults beyond what the schema provides?

Schema description coverage is 100%, and the sole parameter ('edges') is already well defined in the schema. The description adds only that the graph is weighted, which is already implied by the schema's edge weight field, so the baseline 3 applies.

Input schemas describe structure but not intent. Descriptions should explain non-obvious parameter relationships and valid value ranges.

Purpose4/5

Does the description clearly state what the tool does and how it differs from similar tools?

The description states a specific verb ('Find'), resource ('minimum spanning tree'), input type ('weighted graph'), and algorithm ('Kruskal's algorithm'). It is clear what the tool does, but it does not explicitly differentiate itself from sibling graph/algorithm tools such as dijkstra_path or graph_analyze.

Agents choose between tools based on descriptions. A clear purpose with a specific verb and resource helps agents select the right tool.

Usage Guidelines2/5

Does the description explain when to use this tool, when not to, or what alternatives exist?

There is no guidance on when to use this tool versus alternatives, no exclusions, and no prerequisites. The description only states the operation, leaving selection entirely to the agent's inference.

Agents often have multiple tools that could apply. Explicit usage guidance like "use X instead of Y when Z" prevents misuse.

Deploy Server

Other Tools