00:01
Hi, in this question this is a tree diagram which has been given to us.
00:04
We have to use the dfs method to find the spanning tree.
00:11
So the dfs means the vertices we will be, means going to or via the vertices that we will be first coming across with.
00:22
So let's start with the a vertex.
00:25
So a is the vertex which we have traveled.
00:28
So starting with a.
00:29
Now we have to move towards the adjacent vertices.
00:33
Let's move by the alphabetical order.
00:36
So the first one that comes is the d.
00:39
So then we have also moved towards d.
00:42
Over here we will write the suspended vertices.
00:45
So let we have suspended a and now we have moved towards d.
00:49
Now on d there are like so many adjacent two vertices to the d.
00:54
But the first alphabetical vertex which comes across is b.
00:58
So then let's suspend d and we have moved towards the vertex that is b.
01:04
So we have traveled the vertex b.
01:07
Now from b there are so many vertices, there is e, there is c...