56
Depth-first Search
Depth-first search can be described recursively as
depthFirst(G,v):
mark
v
as visited
for each
(v,w)
∈
edges
(G) do
if
w
has not been visited then
depthFirst(w)
The recursion induces
backtracking