Chapter 28.7, Problem 28.7.4CP

Program Plan Intro

Given method of “dfs(v)”:

//method definition

searchtree dfs(vertex v)

{

//visited vertex

visit v;

//for loop

for each neighbor w of v

//condition to check visited vertex

if(w has not been visited)

{

//assign the vertex

set v as the parent for w in the tree;

//call the method recursively

dfs(w);

}

}