Depth-First Search Algorithm

dfs ( v ) mark[v] :=1 print v for each (v, u) Adj[v] if (mark[u] = 0) // not visited yet? dfs (u)

Algorithm DEPTH_FIRST_SEARCH ( V, E ) for each v V mark[v] :=0 // not visited yet for each v V if (mark[v]=0) then dfs (v)

Breadth-First Search Algorithm

bfs ( v , Q) mark[v]:=1 for each (v, u) Adj[v] if (mark[u] != 1) // not visited yet? Q Q + u

Algorithm BREADTH_FIRST_SEARCH ( V, E ) ENQUEUE(Q ,{v0}) // an arbitrary node while Q != {} v:=DEQUEUE(Q) if (mark[v] != 1) print v bfs (v) // explore successors