Let G be a graph and let v be a node of G. procedure DFS(G, v):

label v as discovered

for all w adjacent to v do

if vertex w is not labeled as discovered then

recursively call DFS(G, w)

 Draw a depth-first search tree for the graph starting at a. In your own words, explain what the essential difference is between a breadth-first and a depth-first search tree.

 

g a ho