00:01
In this equation, we are given a graph.
00:03
In this graph, that krushkal, that algorithm we are using.
00:08
So, here, this algorithm that used in this equation to make this graph.
00:17
So, in this algorithm, we need to find the maximum spanning tree.
00:22
So, let's find out, not maximum, it's the minimum spanning tree.
00:27
Here, minimum spanning tree we want to find here.
00:36
So, in the first part of this equation, we have to find total weight.
00:42
Total weight of the spanning, total weight of the spanning tree.
00:50
So, we want to find this total weight.
00:52
So, w we want to find this.
00:54
So, we are given all this value.
00:57
For finding the weight, we can write w which is equal to, here, for the age, here we can write, the age, if.
01:07
We have weight here is 5...