Question $3$

Edge labels

For each of the the following, enter an answer from $\{$tree$,$ forward, back, cross$\}$

Label for edge $($e$,$f$)$

Label for edge $(g,h)$:

Label for edge $($c$,$f$)$: Consider a DFS $($Depth$-$First Search$)$ of the graph below starting from node a$.$ Assume that in the DFS call for that node, the neighbors of the node are processed in alphabetical order.

For the following two sets of questions, you need to determine the label for each edge $--$ tree, forward, back, or cross $--$ and the discovery and finish times for each node. Then, answer the questions below.

a$).$ For each of the following, enter an answer from $\{$tree$,$ forward, back, cross$\}$

$1).$ Label for edge $($e$,$f$)$

$2).$ Label for edge $($g$,$h$)$

$3.)$ Label for edge $($c$,$f$)$

b$).$ For each of the following enter a number in $\{1,2,...,16\}$ representing discovery and finish times

$1).$ Discovery time of h:

$2).$ Discovery time of c:

$3).$ Discovery time of f:Depth$-$first search

Consider a DFS $($Depth$-$First Search$)$ of the graph below starting from node a$.$

Assume that in the DFS call for that node, the neighbors of the node are processed

in alphabetical order.

For the following two sets of questions, you need to determine the label for each

edge $--$ tree, forward, back, or cross $--$ and the discovery and finish times for each

node. Then, answer the questions below.