Given a connected, undirected graph G = (V, E) with edge weights w(u,v)
for each edge (u,v) E,

the minimum spanning tree (MST)
T = (V, E') of G,
, is an acyclic, connected graph
such that w(t) =
is minimized.

**Example**

**Applications**

- Circuit wiring: connecting common pins with minimal wire
- Networking