00:01
Hello students, in this question we are given with the graph.
00:05
So we have to find the minimum spanning tree using prim cell algorithm.
00:11
So first let us choose any one of the vertex.
00:15
So here we are choosing a.
00:18
So from a we have to find the minimum edge.
00:21
So here the minimum edge is a to f that is 5.
00:28
So let us write it af 5 and then from f we have 8, 94, 20, 16 and from a we have 8 and 14.
00:42
So we can choose any edge which has the minimum weight.
00:49
So as we see here, 8 here it is minimum, here it is minimum.
00:54
So we can choose any one of the edge.
00:57
So here i am going to choose a.
01:01
So we will have ac equal to 8.
01:07
Then we will have c.
01:11
From c we can choose the edge which is minimum.
01:17
So it can be from c or a or f.
01:20
So as we see here, here it is 10, 8, 12, 14 and here we are having 8 here.
01:32
So we can choose any one of the edge.
01:37
So i am going to choose cl here which is the minimum edge.
01:46
So cl that is 8.
01:53
Then from this particular vertex we can choose any incoming vertices which are minimum.
02:05
So here we have 13, 15, 15 and we have 10, 12, 14, 94 and here we have 8.
02:15
That is fi is 8.
02:18
So we are going to choose the edge which is fi.
02:24
So fi is 8.
02:31
Next we have to choose the edges from a, f, c, l and i.
02:39
So as we see here, the minimum edge which is next is 12.
02:46
So here it is cg...