# Minimum Spanning Tree

Consider an undirected graph ${\displaystyle G}$ with edge costs. A minimal spanning tree ${\displaystyle T}$ on ${\displaystyle G}$ is a spanning tree such that the sum of its edges is as small as possible. Such an MST is not necessarily unique.