Minimum Spanning Forest Workbench

How to use Minimum Spanning Forest Workbench

Sort edges by exact weight and stable source order, then join components only when an edge connects two previously separate sets. The result is a forest covering every declared node, including disconnected components.

1. Enter model json (schema and units below).
2. Choose the stated convention and check the units and supported model.
3. Calculate, inspect the result, then copy or download it.

Good to know

• Plain decimal JSON numbers or strings, at most six fractional places, magnitude at most 1,000,000,000; raw numeric spellings and duplicate object members are checked. Exact rational arithmetic is capped at 8,192 bits. Text is at most 30,000 characters; a local JSON download preserves exact fractions or full stored approximate numbers. 1–50 unique nodes and 0–500 undirected edges. Self loops are refused; parallel edges and negative weights are allowed. This minimizes total connector weight, not route distance, bandwidth, directed flow or physical construction feasibility.
• Local calculation only; no input persistence or external lookup. Text/JSON is limited to 30000 characters and output to 1000000 characters. Numeric model inputs and precision/work limits are stated on this page. Approximate JSON numbers retain full stored values; exact arithmetic outputs retain decimal or fraction strings. Unsupported states fail explicitly.