00:01
Hello everyone here in this question they said that find a minimum weight spanning tree of the graph and give the weight so we have and they also asked us to make sure that give the explain of the process that you are using so as for the first condition here let's start with the vertex g so vertex g so vertex g here from this step for the step one first we have to minimum the weight minimum the weight on weight on edge connecting g is on is on g is on g dash h where w will be equals to one and which will be connected and for the step two now we have to from h from h from h we can now minimum the weight on edge of e to d where weight will be equal to 1 so it will connect d to c and for the step 4 step 4 step 4 we can we have to minimize the minimum the weight of weight on the edge of edge of e to d sorry d to c where weight will be equals to 2 so it will connect d to c and for the step 5 step 5 here we have to minimum the minimum the weight of weight on edge of d to c d to i sorry c to i it is c to i where weight will be where weight will be equals to one sorry to so it will connect c to i so now by the these steps the left out edge from the the i connects is h g d which we have already span so the so the diagram will come as here it is a and this will be b and here it will be for f and here is g and here is e and d and this will be i and this will be g and here is f so if we connect this we will get the graph sorry diagram like this so this will connect d and g and i so this is how we will get a diagram for this problem this is so this is how we will get a diagram so here it is 7 and this is 1.
05:53
Here gn, h, g n, e is 1.
06:18
So this is 1.
06:23
So 2, this is 2, and it is 1, and this is 5, and this is 6.
06:33
And here it is 3, and this is 2, and this is 4.
06:39
So this is how a diagram we will get.
06:43
Now, so by simple observation, here f connects with h, which means weight is smallest which weight is smallest than the other edges.
07:06
Now similarly a connects b, a connects b where which attaches b with a with b with the tree by connecting a to g...