Question: (basic) (10 points) Note that in the above graph, all edges have distinct weights. Hence the graph has a unique MST. To show that edge

(basic) (10 points) Note that in the above graph, all edges have distinct weights. Hence the graph has a unique MST. To show that edge (B,D) is included in the MST, we only need to find a cut such that (B,D) is a light (cheapest) edge crossing the cut. For example, ({B}, V {B}); here V denotes the entire set of vertices.

(a) (5 points) Show that (G,H) must be included in the MST.

(b) (5 points) Show that (D, G) must be included in the MST.

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!