Potential of Local Search
Since every spanning tree is reachable from any other, then starting with an arbitrary spanning tree we can move to an optimal one using local search.
Impediment: there can be exponentially may spanning trees. The search space is exceedingly large.
In what direction do we search.