Apply the method suggested in Prob. 8 to the graph in Example 1. Do you get the same tree?

Data from Prob. 8

To get a minimum spanning tree, instead of adding shortest edges, one could think of deleting longest edges. For what graphs would this be feasible? Describe an algorithm for this.