Whenever the 8orithm to find the strongly connected components in

1. Whenever the 8orithm to find the strongly connected
components in the graph shown below. of vertices to explore,
always pick the one that is alphabetically first. how each step
clearly starting from the adjacency list representation to the
final connected
Solution
Directions of vertices
A
B
C
D
E
F
G
H
I
J
A
0
0

2. 1
0
0
0
0
1
0
0
B
1
0
0
0
0
0
1
0
0
0
C
0
0
0
1
0

3. 0
0
0
0
0
D
0
0
0
0
0
1
0
0
0
0
E
1
0
0
0
0
0
0
0

4. 1
0
F
0
0
0
0
0
0
0
0
0
1
G
0
0
0
0
0
0
0
0
1
0
H

5. 0
0
0
0
0
1
1
0
0
0
I
0
0
0
0
0
0
0
1
0
0
J
0
0
1

6. 0
0
0
0
0
0
0
A
C,H
B
A,G
C
D
D
F
E
A,I
F
J
G
I
H
F,G
I
H

7. J
C
A
B
C
D
E
F
G
H
I
J
A
0
0
1
0
0
0
0
1
0
0
B
1

8. 0
0
0
0
0
1
0
0
0
C
0
0
0
1
0
0
0
0
0
0
D
0
0
0
0

9. 0
1
0
0
0
0
E
1
0
0
0
0
0
0
0
1
0
F
0
0
0
0
0
0
0

10. 0
0
1
G
0
0
0
0
0
0
0
0
1
0
H
0
0
0
0
0
1
1
0
0
0

11. I
0
0
0
0
0
0
0
1
0
0
J
0
0
1
0
0
0
0
0
0
0