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.
Input Schema
| Name | Required | Description | Default |
|---|---|---|---|
| edges | Yes | Array of weighted edges |