PLSE USE TABLES TO ANSWER QUESTION

Please usE the table $($that we used in class$)$ to show the key steps of the Depth$-$First Traversal on the following directed graph starting from vertex A$.($Note: follow alphabetical order when processing neighbors.$)$

Please also show the resulting Depth$-$First Traversal Tree.

Upload

frontVertex nextNeighbor Visited vertex

vertexQueue

traversalorder

$($front to back$)$

$($front to back$)$

A

A

A

$\backslash$table$[[,,$A$,$A$,],[$A$,,,$A$,],[,$B$,$B$,$B$,],[,$D$,$D$,$BD$,$AB$],[,$E$,$E$,$BDE,ABDE$],[$B$,,,$DE$,],[$D$,$G$,$G$,$EG$,$ABDEG$],[,,,$G$,],[$E$,$F$,$F$,$GF$,$ABDEGF$],[,$H$,$H$,$GFH$,$ABDEGFH$],[$G$,,,$FH$,],[$F$,$C$,$C$,$HC$,$ABDEGFHC$],[,,,$C$,],[$H$,,,$I,ABDEGFHCI$],[$C$,,,,],[$I$,,,,]]$

Depth$-$First Traversal

Given an origin vertex, a depth$-$first traversal

toplertex $q,$

vertestack

visits the origin, then a neighbor of the origin, and a neighbor of the neighbor. It continues in this fashion until it finds no unvisited neighbor.

Backs up by one vertex, it considers another neighbor.

$\backslash$table$[[,,$A$,$A$,$A$],[$A$,,,$A$,],[$B$,$B$,$BA$,AB$