00:01
Hello students, so example with 10 vertices and 20 vertices edges.
00:05
So here vertices are a ,b ,c ,d up to j and widths are for a 10 ,b 5 ,c 7 ,d 4 and in a similar way j 8 and source is for a its source is b and its destination is c.
00:23
So all of these are given in the table form.
00:26
And now the various steps for the kruskal algorithm.
00:31
So here sort all the edges in the non -decreasing order.
00:34
So first we have to arrange all the edges in the non -decreasing order.
00:40
After that so here i according to weight i arrange in the decreasing order.
00:49
Now pick the smallest edge and add it to the span active because we have to kruskal algorithm always give the output of the spanning tree.
00:58
So we have to add the first edge smallest edge.
01:02
So check if the new edge create a cycle.
01:05
If if i take the second edge and if it is creating the cycle then i will reject otherwise i will accept.
01:12
So repeat step 2 and 3 until there are a there are a full edges in the spanning tree.
01:19
So we have to come across all of the edges and after that the spanning tree will be created...