Minimum Spanning Trees

Given a connected, undirected graph G = (V, E) with edge weights w(u,v) for each edge (u,v) $\in$ 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

Minimum Spanning Tree

Minimum Spanning Tree Game