Most important property of DFS on undirected graphs

• Every edge is either a tree edge or an edge between an ancestor and a descendent in the tree.

Previous slide

Next slide

Back to first slide

View graphic version