Describe the sequence of recursive calls made by the depth first search algorithm for the graph shown below, starting from vertex A. (When the algorithm has a choice of more than one vertex, order the choices alphabetically.)
Describe the sequence in which the vertices of the same graph would be processed by a breadth first search starting at A.
Write down an adjacency matrix for this graph.
What are the strongly connected components of this graph?
For your depth first ordering from question 1, write down the depth first search index numbers and the lowlink numbers for each vertex, as computed by Tarjan's strongly connected component algorithm. (Vertex A should have index 0.)