Chapter 11, Problem 47SE

In this exercise we will develop an algorithm to find the strong components of a directed graph G = (V, E).

Recall that a vertexis reachable from a vertexif there is a directed path from u to w.

a) Explain how to use breadth-first search in the directed graph G to find all the vertices reachable from a

vertex

b) Explain how to use breadth-first search in Gcov to find all the vertices from which a vertexis

reachable. (Recall that Gcov is the directed graph obtained from G by reversing the direction of all its

edges.)

e) Explain how to use parts (a) and (b) to construct an algorithm that finds the strong components of a

directed graph G, and explain why your algorithm is correct.