Example Step 7

1

2

3

4

5

6

7

DFS(1)

DFS(2)

DFS(7)

DFS(5)

DFS(4)

DFS(3)

DFS(6)

Note that the edges traversed in the depth first

search form a spanning tree.

Previous slide

Next slide

Back to first slide

View graphic version