edited by
679 views
2 votes
2 votes

Which of the following are correct for Minimum Spanning Tree from graph G with unique weights, with the weight function w: E→R (more than one possible)

  1. If we divide all weights by some non zero value  MST will be unchanged (answer for both positive and negative values divided)
  2. If we multiply all weights by some non zero value  MST will be unchanged (answer for both positive and negative values multiplied)
  3. If we take % by some number for all weight  MST will be unchanged (answer for both positive and negative values )
  4. If we add or subtract all weights by some number MST will remain unchanged. (answer for both positive and negative values)
edited by

Please log in or register to answer this question.

Related questions

4 votes
4 votes
1 answer
2
srestha asked Apr 30, 2018
3,165 views
1) Kruskal Algorithm2) Prims Algorithm3) Dijkstra Algorithm4) Bellman Ford Algorithm5) Floyd Warshall AlgorithmAmong these which one works for onlyi) Positive edge weight...
1 votes
1 votes
0 answers
3
Na462 asked Feb 19, 2018
628 views
Given a graph with positive and distinct edge weights. If I double or triple.. the edge weights then:- 1. Shortest path will remain same2. Mst will remain sameRight?Note ...
2 votes
2 votes
0 answers
4
Dulqar asked Jan 26, 2017
462 views
Show the different minimum spanning Trees Possible in each of the following AlgorithmsPrims AlgorithmKruskal