A connected graph provides a path from every vertex to every other vertex. Connectivity is the condition that lets a spanning tree reach all vertices; without it, a minimum spanning tree covers only the starting vertex’s connected component. section 4.3
City network
The weighted graph of 15 major metropolitan areas models cities as vertices and distances as edge weights. Its minimum spanning tree connects every city, using 14 selected edges with total weight 5372.

