The Input Digraph has 100 vertices
Array of Outneighbor Lists:
0:  19 64 22 10
1:  97 81
2: 
3:  30
4:  38
5:  72 23
6:  70 12
7:  43
8:  25
9: 
10:  68 54 38
11:  78 83
12:  82
13:  92 67
14:  66 95
15:  71 80
16:  81 20
17: 
18: 
19:  55 76 37
20:  97 98
21:  11
22:  86 30
23:  55 92
24:  33  9
25: 
26:  61
27: 
28:  86
29:  89
30: 
31:  96
32:  26
33:  26 81 67
34:  38 48  3
35: 
36:  38
37:  97 35
38:  42 43 96
39: 
40:  11 56
41:   0
42:  51 21
43:  86
44:  27
45: 
46:  94 38
47:  94
48:  64
49: 
50:  63
51:  76
52:  40
53:  21
54: 
55:  31 35
56:  80 47
57:  74
58:  70
59:  13 74
60:  59
61: 
62:   0 85
63:  60
64:  77 98 65 18 21
65:  51
66:  17 13  5
67:  84
68:   8 91 21
69:  33
70: 
71:  66
72:  53
73:  76
74:  60
75: 
76:  13  9
77:  25
78:  50
79:  93
80:  65
81:  66  2
82: 
83:  45
84:  60
85:  62 12
86:  56 84 64
87: 
88: 
89:   3 72 69
90:  76
91:  89 46 77
92: 
93: 
94:  35 20
95: 
96:  31
97:  74 10 71
98:  88 10
99:  81
Vertices Reachable from 0 in BFS Order:
  0 19 64 22 10 55 76 37 77 98 65 18 21 86 30 68 54 38 31 35 13  9 97 25 88
 51 11 56 84  8 91 42 43 96 92 67 74 71 78 83 80 47 60 89 46 66 50 45 94 59
  3 72 69 17  5 63 20 53 33 23 26 81 61  2
Unreachable Vertices: 
  1  4  6  7 12 14 15 16 24 27 28 29 32 34 36 39 40 41 44 48 49 52 57 58 62
 70 73 75 79 82 85 87 90 93 95 99