1. In the start-big minimum-weight spanning tree algorithm, we removed edges from cycles. We could have instead chosen to remove edges that do not disconnect the tree. Do these two algorithms ever differ?
2. Is the start-big minimum-weight spanning tree algorithm more like the opposite of Kruskal or more like the opposite of Prim?
3. An unweighted graph could be considered an edge-weighted graph with all edges of the same weight (perhaps 1). Rewrite Kruskal's algorithm to work with unweighted graphs.