A Minimum Spanning Tree (MST) is a subset of edges that connects all vertices in a graph without cycles and with the minimum possible total edge weight. Here the edge weight is the Haversine distance between cities.