00:01
So, the main concept that is to point this question that is the vertices that is in order that visited with the point of depth.
00:12
So, for the vertex d need a d and a.
00:21
So, the spanning tree resulting from the dfs.
00:25
So, that the conditions that is the pathway that is found from vertex b to the vertex f that is using the depth.
00:37
So, for the first condition that is b is equal to greater than c equal to greater than e and it is equal to greater than f.
00:47
So, the vertices that are based on the order that they are visited on the parameter of the width.
00:55
So, the first search for the vertex b that is b, c, e and a, d, f...