3,800 views
0 votes
0 votes
Multiplying all edge weights by a positive number(>1) will always change the cost of minimum spanning tree.

True/False

2 Answers

2 votes
2 votes
YES.....BUT MST WILL REMAIN SAME.

NEW COST=OLD COST*X

X=POSITIVE NO.
0 votes
0 votes
only you will get change in shortest path value according to your multiplicative value remains will be same

Related questions

0 votes
0 votes
1 answer
1
atulcse asked Jan 13, 2022
500 views
How many minimum spanning trees are possible in this graph?
0 votes
0 votes
0 answers
2
4 votes
4 votes
1 answer
4
srestha asked Apr 30, 2018
3,149 views
1) Kruskal Algorithm2) Prims Algorithm3) Dijkstra Algorithm4) Bellman Ford Algorithm5) Floyd Warshall AlgorithmAmong these which one works for onlyi) Positive edge weight...