## Description

Consider the following directed graph for each of the problems:

1. Perform a breadth-first search on the graph assuming that the vertices and adjacency lists

are listed in alphabetical order. Show the breadth-first search tree that is generated.

2. Perform a depth-first search on the graph assuming that the vertices and adjacency lists

are listed in alphabetical order. Classify each edge as tree, back or cross edge. Label each

vertex with its start and finish time.

3. Remove all the back edges from the graph so it becomes a DAG. Perform a depth-first

search recording the start and finish times. Using those finish times, provide the

topological order that is produced. Provide one other topological order for that graph.

4. Determine the strongly connected components of the graph using the algorithm in section

22.5 of the textbook. Show each step of the algorithm.