← back to legend
Physical / electrical concepts

Steiner tree / MST

Minimum Spanning Tree
How to connect a net with many pins using the least total wire. Routers split a multi-pin net into 2-pin connections using these.

How it looks

Real geometry: CORE3588 copper, drawn from our board file (2D plan view)
1231 mm
Net Net-(Q1-B) on CORE3588 (amber): three pads joined as a tree. Other nets grey.
Real pad positions from CORE3588, tracks hidden, spanning tree computed for this card
1 mm
The reset-button net (six pads around SW1), copper stripped. The dashed lines are the minimum spanning tree: the shortest set of straight links that joins all six pads with no loop (five links for six pads). This is what KiCad draws as the ratsnest.

How it works

Q1 pin 1R60 pin 2R59 pin 2spanning tree: 5.91 mmSteiner tree: 5.61 mmextra joining pointwhat CORE3588 actually has:joined through R60's pad

Where it fits

The MST is what you see as the ratsnest: each dashed link becomes one 2-pad job for the search (A* or Lee).

Those jobs are then queued by net ordering and settled by negotiation.

← back to legend