Review: Depth-First Search
l Depth-first search is another strategy for
exploring a graph
n Explore “deeper” in the graph whenever possible
n Edges are explored out of the most recently
discovered vertex v that still has unexplored edges
n When all of v’s edges have been explored,
backtrack to the vertex from which v was