00:01
In this question we are asked to use cruiscope's algorithm to find a minimum cost spanning tree of this graph.
00:10
So we first write down all the edges with weight 1.
00:21
So there are a, b and c of weight 1.
00:32
For weight 2 edges we have d and i.
00:38
I, weight three edges we have f and the h.
00:56
Weight four edges, we have j.
01:04
Weight five edges, we have e.
01:11
And the weight six edges, we have k.
01:21
And finally we have a weight nine edge, which is g.
01:32
Now we are going to pick edges of the minimum cross -bending tree.
01:41
So here i will use green to represent edges that are picked.
01:58
And i will use red to represent edges that are picked.
01:59
And i will use red to represent edges that are removed so we first go from the smallest weight a bc of weight one but we use alphabetical order so we first choose this a so this is it is picked next we have b and c still of weight one so we have b and c still of weight one so we pick b for c we cannot pick it because if we pick it there will be a loop in the in the minimum cost -spending trees and it will no longer be a tree so it will be removed next we go on to edges of weight two so we'll look at this d, we pick it because no loop is formed, so we can pick it.
04:01
Next we look at this i.
04:06
We still pick it because no loop is formed in this way.
04:15
Next we go on to weight 3.
04:23
F is of weight 3, but if we pick it here it will be a loop...
