There's a path between each pairs of vertices and amongst all potentially exponential many spanning trees, the algorithm is supposed to output the one with the smalle st cost, smallest sum of edge costs. 