00:01
We're given a weighted graph.
00:07
The weight of graph is the one from exercise four.
00:11
We see that this is a weighted graph with vertices, a, b, c, d, e, f, g, h, i, k, l, m -n -o -e.
00:21
And in order to find the maximum spanning tree, we're going to use a modified version of kruzko's algorithm.
00:32
So, for the first step in this algorithm, we'll draw a graph with the vertices of our given graph, but with no edges between vertices.
00:41
So first we have the graph vertices a, b, c, d, e, g, h, i, j, k, l, m, n, o, and p.
01:15
In the next step, we'll find the edge with the largest weight in our giving graph.
01:21
This edge has a weight of 4, and it occurs between j and n, between j and k, and between g and k.
01:36
So first, if we add j and n to our graph, you don't create a circuit.
01:45
If we add j and k to our graph, we don't create a circuit.
01:51
And if we add gk to our graph, we still don't create a circuit.
02:01
In the next step of the remaining edges are given graph, the largest weight is three and occurs between lots of edges.
02:18
So let's go through some of these edges.
02:21
First of all, let's consider the edge bf.
02:39
We add this edge, no problem.
02:43
Consider the edge cg.
02:46
We add this edge still no issues, no circuits.
02:53
We add the edge j.
02:59
And we don't have an issue yet.
03:05
We add the edge hl.
03:11
This is valid.
03:14
We have the edge ij.
03:17
No circuit is formed.
03:21
We have the edge i .m...