Question

Consider the directed graph on 8 vertices given by the following set of adjacency lists.
1 -> [3]
2 -> [5,7,8]
3 -> [4,7]
4 -> [1,5,6]
5 -> [6,8]
6 -> [2]
7 -> [8]
8 -> [7]
How many strongly connected components does the graph have?

Answer 1

i think it is 4[1,5,6]