MST(Minimum Weight Spanning Tree)

Computer Science Level 3

Let G be a connected Undirected graph of 100 vertices and 300 edges. The weight of a minimum spanning tree of G is 500. When the weight of each edge of G is increased by five, the weight of a minimum spanning tree becomes -----?


The answer is 995.

Ishan Tyagi by ISHAN TYAGI , 24, India

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

1 solution

Ishan Tyagi
Feb 5, 2018
  1. Find no of edges in MST 2.MST has nāˆ’1 edges where n is no of vertices. =100āˆ’1=99 edges 3.Each 99 edges in MST increases by 5 so weight in MST increased 99āˆ—5= 495 4.Now total weight of MST =500+495=995
1 Helpful 0 Interesting 0 Brilliant 0 Confused

0 pending reports

Ɨ

Problem Loading...

Note Loading...

Set Loading...