[prev] 71 [next]

Depth-first Search

Depth-first search can be described recursively as

depthFirst(G,v):

  1. mark v as visited
  2. for each (v,w)edges(G) do
       if w has not been visited then
          depthFirst(w)

The recursion induces backtracking