Assume we have a graph which is weighted and undirected. And the weights are real numbers.
If some edges have weights as negative numbers, we make them positive by
1. Finding the minimum weight of all the edges. Let this be w(em).
2. Adding -w(em) to the weights of all the edges.
After doing this, does the Minimum Spanning Tree(MST) of the graph remain the same?