Got a couple questions to answer from an assignment and I’m a little stuck on how to go about it, I can’t find any similar questions to reference too. I’m not sure what theories I should be applying. I don’t know how to mathematically prove them right/wrong. Q: Consider a minimum spanning tree of a […]

- Tags and find an MST on each of those sets. Then connect the two MSTs with the least-cost edge between them. Would this algorithm always return an, Got a couple questions to answer from an assignment and I'm a little stuck on how to go about it, I can't find any similar questions to reference too. I'm not sure what theories I should be applying. I don't know how to mathematically prov, I would also say that yes, the MST from creating one MST from the graph wont always be the same as creating two smaller MSTs and combining them. I don't know how to pro, the two smaller sub tree's would still be the MSTs and for the second part from what I have read on cut property, then we get two separate trees. Are these two trees the MSTs on their respective sets of nodes? Is the edge (u, this edge would always be the lowest crossing edge that connects the two trees. Q: Consider the following algorithm for finding an MST on a, v) a least-weight edge crossing between those two sets of nodes? My assumed Answer: is yes, v) of the MST, weighted graph. If we remove an edge (u