Jesus A. Gonzalez
July 17, 2019
It isn’t unique, changing \((b, c)\) for \((a, h)\) we have another \(MST\) with weight 37
Study the loop invariant of the \(MST-PRIM\) algorithm
Show that a graph has a unique minimum spanning tree if, for every cut of the graph, there is a unique light edge crossing the cut.
What happens if we have negative weights in a graph while constructing a MST?