mst_find
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.
Tool call template
Replace each placeholder with a value matching the input schema. Only required parameters are included; add optional parameters as needed.
{
"id": 1,
"jsonrpc": "2.0",
"method": "tools/call",
"params": {
"arguments": {
"edges": "<edges>"
},
"name": "mst_find"
}
}Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| edges | Yes | Array of weighted edges |