00:01
Hello everyone, in this video we have to find the minimum cost spanning tree on the given graph using kruskal's algorithm.
00:10
So sorting the edges.
00:20
So first we found the minimum edge is d to e that is 1.
00:30
So and then found c to e or e to c that is 11.
00:42
And then c to a or a to c is 12.
00:51
And then c to b or b to c that is 20.
00:58
So after that the minimal count you have found is 12.
01:09
D to a or d to a is 18 but it forms a cycle okay.
01:20
D to a is 18 but it forms cycle.
01:29
And other than you can see b to a or a to b says this 34.
01:38
So that is also form cycle.
01:41
So it is neglected and c to d or d to c you can see that is 38.
01:51
So that is also forms a cycle.
01:56
So that is neglected.
02:00
11, 12, 18, 20 and 29 okay.
02:06
D to b or b to d that is 29.
02:09
So that is also forms cycle.
02:14
So that is neglected...