00:01
So we can use depth first search to produce a spanning tree for the given simple graph.
00:07
We're going to choose a as the root of the spanning tree and then assume that the vertices are ordered alphabetically.
00:15
So here is, so, then we can go ahead and build a spanning tree for a conducted simple graph using depth first search.
00:26
So here's our graph g.
00:30
Now, the steps used by depth first search to produce a spanning tree of g are as follows.
00:38
Okay, so here we go a to b to c, the d, to e, to f, to g, to h, to i.
00:44
So here we have a, and then we see b, we see spanning off from g to h...
