The Input Digraph has 10 vertices
Array of Outneighbor Lists:
0:   1  2
1:   4  2
2:   6  3  7
3: 
4:   9
5:   6  7
6:   1  4  3  2  5
7:   9
8:   6
9:   3  0
Vertices Reachable from 0 in BFS Order:
  0  1  2  4  6  3  7  9  5
Unreachable Vertices: 
  8