Datasets:
SadatHossain01
/
NLGraph-Deluxe

Dataset card Data Studio Files
xet
 Community
1
ID
int64
0
34.4k
Question
stringlengths
246
13.3k
Difficulty
stringclasses
3 values
Answer
stringlengths
1
99
Task
stringclasses
8 values
34,300
In a directed graph with 34 nodes numbered from 0 to 33, node 0 should be visited before node 23 node 0 should be visited before node 13 node 1 should be visited before node 10 node 1 should be visited before node 6 node 1 should be visited before node 11 node 1 should be visited before node 3 node 1 should be visited ...
hard
Yes 9 4 1 10 20 3 6 19 11 24 30 22 32 18 26 16 29 15 17 14 8 25 5 27 33 7 28 21 12 31 2 0 23 13
topology
34,301
In a directed graph with 28 nodes numbered from 0 to 27, node 0 should be visited before node 10 node 0 should be visited before node 11 node 0 should be visited before node 16 node 0 should be visited before node 24 node 0 should be visited before node 13 node 0 should be visited before node 26 node 0 should be visite...
hard
Yes 15 3 19 1 20 7 23 12 6 4 8 2 14 21 0 11 16 25 10 26 24 9 13 18 27 22 5 17
topology
34,302
In a directed graph with 32 nodes numbered from 0 to 31, node 0 should be visited before node 24 node 0 should be visited before node 18 node 0 should be visited before node 11 node 0 should be visited before node 25 node 0 should be visited before node 10 node 0 should be visited before node 7 node 1 should be visited...
hard
Yes 22 29 15 4 2 20 26 27 17 14 12 6 5 1 9 13 3 19 21 0 24 30 8 23 28 11 18 31 16 10 7 25
topology
34,303
In a directed graph with 29 nodes numbered from 0 to 28, node 0 should be visited before node 19 node 0 should be visited before node 4 node 0 should be visited before node 1 node 0 should be visited before node 22 node 0 should be visited before node 14 node 1 should be visited before node 21 node 1 should be visited ...
hard
Yes 13 26 10 24 9 2 28 25 17 3 18 23 8 16 7 5 15 20 11 27 0 4 1 19 22 21 12 14 6
topology
34,304
In a directed graph with 34 nodes numbered from 0 to 33, node 0 should be visited before node 24 node 0 should be visited before node 11 node 0 should be visited before node 15 node 0 should be visited before node 18 node 1 should be visited before node 12 node 1 should be visited before node 32 node 1 should be visite...
hard
Yes 31 26 30 27 22 21 17 20 14 23 9 25 10 7 4 3 19 33 13 6 2 8 1 32 12 5 0 11 24 15 28 29 16 18
topology
34,305
In a directed graph with 33 nodes numbered from 0 to 32, node 0 should be visited before node 9 node 0 should be visited before node 20 node 0 should be visited before node 32 node 0 should be visited before node 14 node 0 should be visited before node 17 node 1 should be visited before node 32 node 1 should be visited...
hard
Yes 13 12 3 2 29 26 19 6 11 28 5 25 18 24 23 15 30 27 4 0 14 20 17 8 9 1 32 22 10 16 31 21 7
topology
34,306
In a directed graph with 32 nodes numbered from 0 to 31, node 0 should be visited before node 18 node 0 should be visited before node 16 node 0 should be visited before node 21 node 0 should be visited before node 24 node 0 should be visited before node 2 node 0 should be visited before node 10 node 1 should be visited...
hard
Yes 8 20 1 25 26 13 14 11 28 6 9 4 3 12 29 7 27 17 0 18 30 23 16 21 24 31 10 15 2 22 19 5
topology
34,307
In a directed graph with 33 nodes numbered from 0 to 32, node 0 should be visited before node 12 node 0 should be visited before node 22 node 0 should be visited before node 2 node 0 should be visited before node 30 node 0 should be visited before node 18 node 0 should be visited before node 11 node 1 should be visited...
hard
Yes 32 27 24 10 23 15 7 17 20 5 0 12 28 2 22 30 9 13 26 4 3 16 18 29 6 14 11 31 21 8 1 25 19
topology
34,308
In a directed graph with 33 nodes numbered from 0 to 32, node 0 should be visited before node 28 node 1 should be visited before node 12 node 1 should be visited before node 9 node 1 should be visited before node 28 node 1 should be visited before node 23 node 2 should be visited before node 6 node 2 should be visited ...
hard
Yes 27 26 22 17 16 19 18 30 10 29 15 8 11 4 13 3 5 32 20 25 7 2 21 6 14 24 1 23 9 31 12 0 28
topology
34,309
In a directed graph with 28 nodes numbered from 0 to 27, node 1 should be visited before node 22 node 1 should be visited before node 10 node 1 should be visited before node 24 node 1 should be visited before node 13 node 1 should be visited before node 5 node 1 should be visited before node 14 node 1 should be visited...
hard
Yes 17 8 6 20 1 24 22 27 10 23 13 16 21 4 5 2 12 14 15 19 25 11 26 3 9 7 18 0
topology
34,310
In a directed graph with 31 nodes numbered from 0 to 30, node 0 should be visited before node 3 node 0 should be visited before node 1 node 0 should be visited before node 29 node 0 should be visited before node 26 node 0 should be visited before node 30 node 1 should be visited before node 5 node 1 should be visited b...
hard
Yes 19 10 17 9 4 18 23 16 22 8 28 21 27 13 24 2 0 29 1 12 5 3 14 6 25 15 7 20 11 30 26
topology
34,311
In a directed graph with 32 nodes numbered from 0 to 31, node 1 should be visited before node 29 node 1 should be visited before node 28 node 1 should be visited before node 7 node 1 should be visited before node 6 node 1 should be visited before node 20 node 1 should be visited before node 15 node 1 should be visited ...
hard
Yes 18 17 11 16 24 8 4 2 30 19 23 14 25 27 12 1 7 28 6 20 29 21 9 26 22 31 15 10 13 5 3 0
topology
34,312
In a directed graph with 28 nodes numbered from 0 to 27, node 0 should be visited before node 18 node 0 should be visited before node 10 node 0 should be visited before node 27 node 1 should be visited before node 0 node 1 should be visited before node 18 node 1 should be visited before node 10 node 1 should be visited...
hard
Yes 19 17 12 26 24 20 5 8 14 9 16 21 15 25 4 23 6 11 22 3 2 7 1 0 18 27 10 13
topology
34,313
In a directed graph with 29 nodes numbered from 0 to 28, node 0 should be visited before node 20 node 0 should be visited before node 26 node 0 should be visited before node 8 node 0 should be visited before node 22 node 0 should be visited before node 2 node 0 should be visited before node 13 node 0 should be visited ...
hard
Yes 27 21 6 19 12 4 10 0 20 22 13 2 28 14 26 8 5 18 3 7 25 11 23 24 9 15 1 16 17
topology
34,314
In a directed graph with 28 nodes numbered from 0 to 27, node 0 should be visited before node 13 node 0 should be visited before node 7 node 0 should be visited before node 6 node 0 should be visited before node 3 node 0 should be visited before node 12 node 0 should be visited before node 8 node 0 should be visited be...
hard
Yes 23 15 19 27 1 0 7 6 3 18 25 8 13 21 10 9 24 12 14 17 2 5 26 11 20 16 22 4
topology
34,315
In a directed graph with 27 nodes numbered from 0 to 26, node 0 should be visited before node 19 node 1 should be visited before node 5 node 1 should be visited before node 26 node 1 should be visited before node 24 node 2 should be visited before node 7 node 2 should be visited before node 1 node 2 should be visited b...
hard
Yes 20 21 15 6 25 17 11 9 12 3 10 22 18 23 4 16 13 2 8 7 14 1 24 5 0 19 26
topology
34,316
In a directed graph with 26 nodes numbered from 0 to 25, node 0 should be visited before node 12 node 0 should be visited before node 7 node 0 should be visited before node 11 node 1 should be visited before node 6 node 1 should be visited before node 2 node 1 should be visited before node 21 node 1 should be visited b...
hard
Yes 19 9 1 2 18 24 23 15 6 17 21 8 10 13 25 22 5 16 4 0 7 11 12 3 20 14
topology
34,317
In a directed graph with 28 nodes numbered from 0 to 27, node 1 should be visited before node 2 node 1 should be visited before node 17 node 1 should be visited before node 3 node 1 should be visited before node 4 node 1 should be visited before node 15 node 2 should be visited before node 17 node 2 should be visited b...
hard
Yes 23 16 13 6 12 10 19 24 22 14 9 7 11 26 5 8 20 1 2 17 18 4 27 21 25 3 15 0
topology
34,318
In a directed graph with 27 nodes numbered from 0 to 26, node 0 should be visited before node 2 node 0 should be visited before node 23 node 1 should be visited before node 4 node 3 should be visited before node 19 node 3 should be visited before node 15 node 3 should be visited before node 17 node 3 should be visited ...
hard
Yes 22 25 13 18 16 12 11 14 24 26 8 7 3 5 15 19 20 6 10 17 21 9 1 4 0 23 2
topology
34,319
In a directed graph with 34 nodes numbered from 0 to 33, node 0 should be visited before node 4 node 1 should be visited before node 12 node 1 should be visited before node 4 node 2 should be visited before node 3 node 2 should be visited before node 9 node 2 should be visited before node 24 node 2 should be visited be...
hard
Yes 31 28 18 22 16 15 19 21 17 14 23 26 13 32 10 8 7 2 27 29 3 9 30 5 25 33 24 6 20 11 1 12 0 4
topology
34,320
In a directed graph with 33 nodes numbered from 0 to 32, node 1 should be visited before node 18 node 1 should be visited before node 5 node 1 should be visited before node 26 node 1 should be visited before node 15 node 1 should be visited before node 29 node 1 should be visited before node 8 node 1 should be visited ...
hard
Yes 21 31 17 6 23 7 19 9 10 28 20 11 3 22 1 5 32 12 14 4 26 2 29 24 15 18 13 8 25 30 16 27 0
topology
34,321
In a directed graph with 32 nodes numbered from 0 to 31, node 0 should be visited before node 15 node 1 should be visited before node 9 node 1 should be visited before node 25 node 1 should be visited before node 24 node 1 should be visited before node 3 node 1 should be visited before node 22 node 1 should be visited ...
hard
Yes 17 8 18 29 4 16 28 21 5 7 19 14 13 26 12 1 9 25 27 31 6 22 24 10 3 23 30 0 15 20 11 2
topology
34,322
In a directed graph with 35 nodes numbered from 0 to 34, node 0 should be visited before node 1 node 0 should be visited before node 25 node 2 should be visited before node 18 node 2 should be visited before node 13 node 2 should be visited before node 0 node 3 should be visited before node 16 node 3 should be visited ...
hard
Yes 27 19 12 6 9 32 7 29 30 3 22 15 21 10 24 16 4 5 2 18 14 20 8 11 13 17 26 33 23 34 31 28 0 25 1
topology
34,323
In a directed graph with 29 nodes numbered from 0 to 28, node 0 should be visited before node 26 node 0 should be visited before node 19 node 0 should be visited before node 17 node 0 should be visited before node 18 node 0 should be visited before node 2 node 1 should be visited before node 7 node 1 should be visited ...
hard
Yes 27 23 5 4 3 10 9 14 8 24 6 28 15 20 13 21 16 11 0 2 18 26 22 25 1 7 17 12 19
topology
34,324
In a directed graph with 28 nodes numbered from 0 to 27, node 0 should be visited before node 3 node 0 should be visited before node 13 node 0 should be visited before node 8 node 1 should be visited before node 5 node 1 should be visited before node 18 node 1 should be visited before node 17 node 3 should be visited b...
hard
Yes 15 14 11 12 10 6 9 7 27 4 1 18 5 0 3 23 21 13 22 25 8 17 26 19 2 16 20 24
topology
34,325
In a directed graph with 34 nodes numbered from 0 to 33, node 0 should be visited before node 29 node 0 should be visited before node 26 node 0 should be visited before node 4 node 2 should be visited before node 14 node 2 should be visited before node 33 node 2 should be visited before node 29 node 2 should be visited...
hard
Yes 23 19 15 27 3 24 22 13 6 25 5 11 18 10 31 30 12 9 32 20 17 16 2 33 14 21 28 7 0 29 1 26 4 8
topology
34,326
In a directed graph with 31 nodes numbered from 0 to 30, node 0 should be visited before node 30 node 0 should be visited before node 8 node 0 should be visited before node 2 node 0 should be visited before node 4 node 0 should be visited before node 18 node 0 should be visited before node 21 node 0 should be visited b...
hard
Yes 11 5 19 15 0 30 8 28 2 4 10 6 3 13 7 18 20 21 14 26 23 29 16 22 12 25 9 27 1 17 24
topology
34,327
In a directed graph with 35 nodes numbered from 0 to 34, node 0 should be visited before node 32 node 0 should be visited before node 24 node 0 should be visited before node 18 node 0 should be visited before node 16 node 0 should be visited before node 34 node 1 should be visited before node 8 node 1 should be visited...
hard
Yes 33 22 21 5 11 30 12 31 26 17 9 13 6 7 20 2 27 1 0 24 32 15 4 29 16 28 25 3 14 18 23 10 34 19 8
topology
34,328
In a directed graph with 35 nodes numbered from 0 to 34, node 0 should be visited before node 23 node 0 should be visited before node 21 node 0 should be visited before node 13 node 0 should be visited before node 16 node 0 should be visited before node 19 node 1 should be visited before node 5 node 1 should be visited...
hard
Yes 33 27 28 20 18 12 11 9 26 17 1 5 0 13 21 30 23 34 31 22 16 32 15 10 2 8 24 6 4 25 19 3 14 29 7
topology
34,329
In a directed graph with 31 nodes numbered from 0 to 30, node 0 should be visited before node 22 node 2 should be visited before node 21 node 2 should be visited before node 13 node 2 should be visited before node 5 node 2 should be visited before node 20 node 2 should be visited before node 4 node 2 should be visited ...
hard
Yes 10 7 17 25 11 19 14 16 23 26 9 24 2 21 15 13 28 12 5 27 6 20 4 8 3 30 0 22 29 1 18
topology
34,330
In a directed graph with 28 nodes numbered from 0 to 27, node 0 should be visited before node 17 node 0 should be visited before node 22 node 1 should be visited before node 17 node 1 should be visited before node 10 node 1 should be visited before node 25 node 1 should be visited before node 18 node 1 should be visite...
hard
Yes 20 19 8 5 7 27 9 4 15 6 13 3 14 26 2 24 1 18 0 22 21 17 11 10 25 16 23 12
topology
34,331
In a directed graph with 29 nodes numbered from 0 to 28, node 1 should be visited before node 0 node 1 should be visited before node 18 node 1 should be visited before node 2 node 3 should be visited before node 11 node 3 should be visited before node 9 node 3 should be visited before node 22 node 3 should be visited b...
hard
Yes 23 17 21 15 24 25 27 10 12 20 16 8 4 3 22 9 11 7 13 6 28 5 26 14 19 1 2 18 0
topology
34,332
In a directed graph with 29 nodes numbered from 0 to 28, node 0 should be visited before node 19 node 0 should be visited before node 4 node 0 should be visited before node 17 node 0 should be visited before node 1 node 0 should be visited before node 12 node 0 should be visited before node 21 node 1 should be visited ...
hard
Yes 16 14 13 23 28 15 8 22 27 10 3 18 11 7 25 2 24 26 0 19 4 6 17 20 1 9 5 12 21
topology
34,333
In a directed graph with 26 nodes numbered from 0 to 25, node 0 should be visited before node 20 node 0 should be visited before node 1 node 0 should be visited before node 10 node 0 should be visited before node 7 node 0 should be visited before node 13 node 0 should be visited before node 11 node 0 should be visited ...
hard
Yes 17 25 16 22 12 23 21 0 20 1 2 3 10 8 6 13 11 15 7 24 4 5 19 9 14 18
topology
34,334
In a directed graph with 26 nodes numbered from 0 to 25, node 0 should be visited before node 21 node 0 should be visited before node 14 node 0 should be visited before node 10 node 0 should be visited before node 7 node 0 should be visited before node 16 node 0 should be visited before node 19 node 0 should be visited...
hard
Yes 15 12 23 17 24 25 5 2 6 18 0 21 14 1 3 13 7 10 16 9 22 8 20 19 4 11
topology
34,335
In a directed graph with 33 nodes numbered from 0 to 32, node 1 should be visited before node 7 node 1 should be visited before node 30 node 1 should be visited before node 21 node 1 should be visited before node 27 node 1 should be visited before node 3 node 1 should be visited before node 14 node 1 should be visited ...
hard
Yes 17 9 15 10 13 32 20 28 29 24 22 18 8 2 5 19 6 12 25 4 16 11 23 31 26 1 7 30 21 27 14 3 0
topology
34,336
In a directed graph with 29 nodes numbered from 0 to 28, node 0 should be visited before node 27 node 0 should be visited before node 12 node 0 should be visited before node 24 node 1 should be visited before node 17 node 1 should be visited before node 18 node 1 should be visited before node 12 node 1 should be visite...
hard
Yes 28 19 4 16 21 3 1 17 26 11 5 8 22 2 25 18 9 6 0 12 27 10 24 7 15 23 20 13 14
topology
34,337
In a directed graph with 30 nodes numbered from 0 to 29, node 0 should be visited before node 23 node 0 should be visited before node 9 node 0 should be visited before node 15 node 0 should be visited before node 29 node 0 should be visited before node 11 node 0 should be visited before node 8 node 2 should be visited ...
hard
Yes 27 28 26 25 20 18 12 7 22 6 19 5 10 4 24 13 0 15 9 23 17 21 14 16 29 3 2 1 11 8
topology
34,338
In a directed graph with 29 nodes numbered from 0 to 28, node 0 should be visited before node 2 node 0 should be visited before node 10 node 0 should be visited before node 19 node 0 should be visited before node 6 node 0 should be visited before node 9 node 0 should be visited before node 16 node 0 should be visited b...
hard
Yes 25 22 24 12 15 7 5 23 18 26 0 19 10 2 4 6 21 16 9 14 13 3 27 11 20 8 28 17 1
topology
34,339
In a directed graph with 34 nodes numbered from 0 to 33, node 0 should be visited before node 28 node 0 should be visited before node 27 node 0 should be visited before node 4 node 0 should be visited before node 24 node 0 should be visited before node 14 node 0 should be visited before node 20 node 0 should be visited...
hard
Yes 32 26 21 5 2 33 18 6 29 23 0 4 28 24 16 27 14 20 8 30 3 1 10 22 15 31 17 9 19 7 25 11 12 13
topology
34,340
In a directed graph with 33 nodes numbered from 0 to 32, node 0 should be visited before node 12 node 0 should be visited before node 22 node 0 should be visited before node 18 node 0 should be visited before node 31 node 0 should be visited before node 23 node 0 should be visited before node 21 node 0 should be visite...
hard
Yes 15 1 5 7 0 18 6 31 13 22 19 14 23 21 27 12 10 11 20 29 9 16 17 4 8 26 3 2 32 25 24 28 30
topology
34,341
In a directed graph with 31 nodes numbered from 0 to 30, node 0 should be visited before node 30 node 1 should be visited before node 20 node 1 should be visited before node 18 node 1 should be visited before node 21 node 1 should be visited before node 28 node 1 should be visited before node 23 node 1 should be visite...
hard
Yes 17 16 4 19 7 13 11 10 9 27 8 25 1 18 12 26 23 21 24 6 3 15 14 22 20 29 28 2 5 0 30
topology
34,342
In a directed graph with 28 nodes numbered from 0 to 27, node 0 should be visited before node 10 node 0 should be visited before node 24 node 2 should be visited before node 23 node 2 should be visited before node 10 node 2 should be visited before node 15 node 3 should be visited before node 14 node 3 should be visite...
hard
Yes 8 12 5 4 13 20 18 27 6 11 17 21 3 19 7 16 25 14 2 15 23 26 22 9 1 0 24 10
topology
34,343
In a directed graph with 29 nodes numbered from 0 to 28, node 0 should be visited before node 4 node 0 should be visited before node 27 node 0 should be visited before node 28 node 0 should be visited before node 26 node 0 should be visited before node 14 node 0 should be visited before node 19 node 0 should be visited...
hard
Yes 12 2 0 27 4 14 28 18 17 19 13 26 10 9 8 6 22 1 20 21 3 16 7 23 15 11 5 24 25
topology
34,344
In a directed graph with 27 nodes numbered from 0 to 26, node 0 should be visited before node 5 node 2 should be visited before node 11 node 2 should be visited before node 14 node 2 should be visited before node 1 node 2 should be visited before node 15 node 2 should be visited before node 5 node 3 should be visited b...
hard
Yes 16 23 4 7 18 8 17 21 25 24 22 26 19 6 2 15 11 9 3 12 10 20 13 14 1 0 5
topology
34,345
In a directed graph with 26 nodes numbered from 0 to 25, node 0 should be visited before node 5 node 0 should be visited before node 7 node 1 should be visited before node 19 node 1 should be visited before node 0 node 1 should be visited before node 5 node 1 should be visited before node 21 node 1 should be visited be...
hard
Yes 6 11 18 22 23 2 8 15 25 17 9 3 4 10 1 19 20 24 0 5 14 13 16 21 7 12
topology
34,346
In a directed graph with 34 nodes numbered from 0 to 33, node 0 should be visited before node 33 node 0 should be visited before node 25 node 0 should be visited before node 1 node 0 should be visited before node 19 node 0 should be visited before node 12 node 0 should be visited before node 23 node 0 should be visited...
hard
Yes 26 21 22 10 7 18 31 17 8 28 16 3 29 6 27 32 30 9 14 5 4 0 33 1 19 20 25 15 24 23 2 12 11 13
topology
34,347
In a directed graph with 26 nodes numbered from 0 to 25, node 0 should be visited before node 13 node 0 should be visited before node 22 node 0 should be visited before node 11 node 1 should be visited before node 7 node 1 should be visited before node 15 node 1 should be visited before node 13 node 2 should be visited...
hard
Yes 21 17 19 8 3 10 23 24 4 5 18 14 12 6 20 25 9 1 7 15 2 16 0 22 11 13
topology
34,348
In a directed graph with 26 nodes numbered from 0 to 25, node 0 should be visited before node 25 node 0 should be visited before node 12 node 0 should be visited before node 17 node 0 should be visited before node 3 node 0 should be visited before node 14 node 0 should be visited before node 22 node 0 should be visited...
hard
Yes 18 5 4 23 13 24 1 2 10 0 17 25 22 8 3 14 6 12 7 16 15 21 20 11 19 9
topology
34,349
In a directed graph with 27 nodes numbered from 0 to 26, node 0 should be visited before node 15 node 0 should be visited before node 17 node 0 should be visited before node 21 node 1 should be visited before node 17 node 2 should be visited before node 20 node 2 should be visited before node 26 node 2 should be visite...
hard
Yes 25 9 6 19 5 16 12 11 7 10 2 26 20 18 22 14 13 8 24 3 4 23 1 0 21 17 15
topology
34,350
In a directed graph with 26 nodes numbered from 0 to 25, node 0 should be visited before node 1 node 0 should be visited before node 24 node 2 should be visited before node 9 node 3 should be visited before node 22 node 3 should be visited before node 18 node 3 should be visited before node 9 node 3 should be visited b...
hard
Yes 25 20 15 19 17 11 6 12 5 23 10 16 8 21 4 14 3 22 18 7 2 9 13 0 24 1
topology
34,351
In a directed graph with 31 nodes numbered from 0 to 30, node 0 should be visited before node 7 node 0 should be visited before node 11 node 0 should be visited before node 13 node 0 should be visited before node 28 node 0 should be visited before node 22 node 0 should be visited before node 3 node 1 should be visited ...
hard
Yes 20 17 10 18 23 16 29 21 26 5 24 25 4 2 27 15 14 8 1 6 9 30 19 0 28 11 7 13 22 12 3
topology
34,352
In a directed graph with 26 nodes numbered from 0 to 25, node 1 should be visited before node 7 node 1 should be visited before node 20 node 2 should be visited before node 22 node 2 should be visited before node 7 node 2 should be visited before node 0 node 3 should be visited before node 15 node 3 should be visited b...
hard
Yes 19 25 23 16 12 17 21 5 14 3 15 24 8 18 11 9 13 4 6 2 22 1 20 7 10 0
topology
34,353
In a directed graph with 33 nodes numbered from 0 to 32, node 0 should be visited before node 5 node 1 should be visited before node 18 node 1 should be visited before node 16 node 1 should be visited before node 13 node 1 should be visited before node 32 node 1 should be visited before node 24 node 1 should be visited...
hard
Yes 29 17 6 9 25 14 4 3 2 1 18 16 31 24 32 23 13 21 8 10 7 26 12 28 27 20 11 30 15 22 19 0 5
topology
34,354
In a directed graph with 26 nodes numbered from 0 to 25, node 0 should be visited before node 14 node 0 should be visited before node 15 node 0 should be visited before node 2 node 0 should be visited before node 5 node 0 should be visited before node 1 node 2 should be visited before node 5 node 2 should be visited be...
hard
Yes 22 12 18 21 0 14 19 6 4 17 7 25 11 9 8 3 2 16 24 1 23 13 5 15 20 10
topology
34,355
In a directed graph with 26 nodes numbered from 0 to 25, node 0 should be visited before node 9 node 0 should be visited before node 22 node 0 should be visited before node 25 node 0 should be visited before node 18 node 0 should be visited before node 5 node 0 should be visited before node 7 node 0 should be visited b...
hard
Yes 13 11 3 8 10 16 14 4 2 0 18 22 9 25 5 17 23 21 20 1 15 7 19 24 12 6
topology
34,356
In a directed graph with 32 nodes numbered from 0 to 31, node 0 should be visited before node 14 node 1 should be visited before node 14 node 1 should be visited before node 17 node 2 should be visited before node 4 node 2 should be visited before node 15 node 2 should be visited before node 20 node 2 should be visited...
hard
Yes 24 23 18 16 27 13 12 22 29 11 26 6 9 2 28 15 20 19 8 31 10 25 5 4 30 7 3 21 1 0 14 17
topology
34,357
In a directed graph with 30 nodes numbered from 0 to 29, node 0 should be visited before node 1 node 0 should be visited before node 28 node 0 should be visited before node 25 node 0 should be visited before node 11 node 0 should be visited before node 13 node 0 should be visited before node 17 node 0 should be visited...
hard
Yes 20 8 2 3 18 15 7 10 4 22 19 14 23 16 24 5 0 25 1 29 28 13 26 11 21 12 9 17 6 27
topology
34,358
In a directed graph with 31 nodes numbered from 0 to 30, node 0 should be visited before node 20 node 0 should be visited before node 8 node 0 should be visited before node 2 node 0 should be visited before node 24 node 0 should be visited before node 4 node 0 should be visited before node 11 node 1 should be visited b...
hard
Yes 29 16 9 6 14 15 23 21 0 8 20 12 3 10 7 26 28 13 22 24 27 17 30 2 18 4 1 19 5 25 11
topology
34,359
In a directed graph with 31 nodes numbered from 0 to 30, node 1 should be visited before node 23 node 1 should be visited before node 16 node 2 should be visited before node 18 node 2 should be visited before node 4 node 2 should be visited before node 12 node 2 should be visited before node 25 node 2 should be visited...
hard
Yes 29 21 24 30 14 8 19 26 7 27 5 17 20 9 6 11 2 18 22 28 13 4 12 25 3 1 16 10 23 15 0
topology
34,360
In a directed graph with 29 nodes numbered from 0 to 28, node 0 should be visited before node 21 node 0 should be visited before node 1 node 0 should be visited before node 16 node 0 should be visited before node 4 node 0 should be visited before node 15 node 0 should be visited before node 22 node 0 should be visited ...
hard
Yes 27 2 23 12 6 7 25 8 9 17 20 24 3 10 28 5 26 0 21 18 13 1 11 16 15 4 22 14 19
topology
34,361
In a directed graph with 28 nodes numbered from 0 to 27, node 0 should be visited before node 9 node 0 should be visited before node 17 node 0 should be visited before node 12 node 0 should be visited before node 8 node 0 should be visited before node 1 node 0 should be visited before node 4 node 1 should be visited be...
hard
Yes 22 21 27 20 19 18 11 5 14 26 15 25 16 24 23 7 2 13 10 3 6 0 8 9 17 12 1 4
topology
34,362
In a directed graph with 26 nodes numbered from 0 to 25, node 0 should be visited before node 11 node 0 should be visited before node 1 node 0 should be visited before node 9 node 0 should be visited before node 8 node 0 should be visited before node 12 node 0 should be visited before node 24 node 0 should be visited b...
hard
Yes 23 22 7 4 2 25 17 0 11 1 3 9 8 12 20 24 21 16 14 10 19 15 13 6 18 5
topology
34,363
In a directed graph with 28 nodes numbered from 0 to 27, node 0 should be visited before node 15 node 0 should be visited before node 19 node 0 should be visited before node 18 node 1 should be visited before node 23 node 1 should be visited before node 22 node 1 should be visited before node 25 node 1 should be visite...
hard
Yes 26 8 2 10 3 1 23 22 17 20 5 16 27 11 6 25 24 12 14 4 9 7 13 21 0 18 19 15
topology
34,364
In a directed graph with 28 nodes numbered from 0 to 27, node 0 should be visited before node 20 node 1 should be visited before node 5 node 1 should be visited before node 16 node 1 should be visited before node 7 node 1 should be visited before node 0 node 2 should be visited before node 16 node 2 should be visited b...
hard
Yes 27 6 4 13 21 14 3 15 22 26 17 8 24 10 18 23 9 11 25 2 1 5 12 7 19 16 0 20
topology
34,365
In a directed graph with 28 nodes numbered from 0 to 27, node 1 should be visited before node 17 node 2 should be visited before node 9 node 3 should be visited before node 15 node 3 should be visited before node 12 node 3 should be visited before node 21 node 3 should be visited before node 10 node 3 should be visited...
hard
Yes 26 3 12 20 22 15 21 16 27 24 25 23 10 19 18 7 13 11 4 14 6 8 5 2 9 1 17 0
topology
34,366
In a directed graph with 35 nodes numbered from 0 to 34, node 0 should be visited before node 17 node 0 should be visited before node 30 node 0 should be visited before node 28 node 0 should be visited before node 12 node 0 should be visited before node 25 node 0 should be visited before node 24 node 0 should be visite...
hard
Yes 33 14 4 16 26 34 1 0 30 17 28 9 15 8 12 25 21 7 10 23 5 24 2 18 19 27 31 11 6 22 20 32 3 13 29
topology
34,367
In a directed graph with 32 nodes numbered from 0 to 31, node 0 should be visited before node 5 node 0 should be visited before node 14 node 0 should be visited before node 9 node 1 should be visited before node 12 node 1 should be visited before node 4 node 1 should be visited before node 29 node 1 should be visited b...
hard
Yes 27 25 1 29 4 30 28 12 11 7 24 3 19 23 6 13 16 2 20 21 10 17 22 8 18 15 26 31 0 5 14 9
topology
34,368
In a directed graph with 27 nodes numbered from 0 to 26, node 0 should be visited before node 21 node 0 should be visited before node 15 node 0 should be visited before node 2 node 1 should be visited before node 9 node 1 should be visited before node 21 node 1 should be visited before node 15 node 1 should be visited ...
hard
Yes 26 22 19 17 14 7 4 5 6 18 13 24 23 3 1 9 16 0 21 20 11 2 25 15 8 12 10
topology
34,369
In a directed graph with 34 nodes numbered from 0 to 33, node 1 should be visited before node 8 node 1 should be visited before node 5 node 1 should be visited before node 14 node 1 should be visited before node 19 node 1 should be visited before node 11 node 1 should be visited before node 31 node 2 should be visited ...
hard
Yes 23 13 20 25 10 33 18 9 22 15 16 24 27 7 32 6 29 26 3 12 30 17 4 21 28 1 5 8 2 11 14 19 31 0
topology
34,370
In a directed graph with 34 nodes numbered from 0 to 33, node 0 should be visited before node 3 node 0 should be visited before node 11 node 0 should be visited before node 33 node 0 should be visited before node 12 node 0 should be visited before node 13 node 0 should be visited before node 26 node 0 should be visited...
hard
Yes 14 21 4 2 5 19 20 22 15 0 11 25 23 24 3 9 1 7 31 32 12 10 28 6 33 27 8 18 13 30 26 17 29 16
topology
34,371
In a directed graph with 34 nodes numbered from 0 to 33, node 0 should be visited before node 2 node 0 should be visited before node 30 node 0 should be visited before node 1 node 0 should be visited before node 28 node 0 should be visited before node 19 node 0 should be visited before node 11 node 1 should be visited ...
hard
Yes 22 27 23 18 25 17 31 26 14 13 24 21 32 12 4 16 3 8 6 9 15 7 10 0 19 1 2 11 30 28 33 20 29 5
topology
34,372
In a directed graph with 26 nodes numbered from 0 to 25, node 0 should be visited before node 25 node 0 should be visited before node 7 node 0 should be visited before node 24 node 0 should be visited before node 9 node 0 should be visited before node 13 node 0 should be visited before node 3 node 0 should be visited b...
hard
Yes 8 5 18 11 12 0 25 7 10 23 14 21 1 17 6 22 16 13 15 2 4 24 3 20 9 19
topology
34,373
In a directed graph with 27 nodes numbered from 0 to 26, node 0 should be visited before node 21 node 0 should be visited before node 17 node 0 should be visited before node 10 node 0 should be visited before node 11 node 0 should be visited before node 22 node 0 should be visited before node 12 node 0 should be visite...
hard
Yes 19 14 7 8 0 21 10 15 17 24 11 13 2 4 12 25 22 23 5 26 6 1 9 3 20 16 18
topology
34,374
In a directed graph with 32 nodes numbered from 0 to 31, node 0 should be visited before node 30 node 0 should be visited before node 9 node 0 should be visited before node 2 node 0 should be visited before node 20 node 0 should be visited before node 14 node 1 should be visited before node 7 node 1 should be visited b...
hard
Yes 28 24 17 31 11 10 21 25 5 29 16 3 15 1 6 7 8 12 19 22 26 23 0 2 9 4 13 20 18 30 27 14
topology
34,375
In a directed graph with 34 nodes numbered from 0 to 33, node 0 should be visited before node 9 node 0 should be visited before node 13 node 0 should be visited before node 7 node 0 should be visited before node 20 node 0 should be visited before node 3 node 2 should be visited before node 13 node 2 should be visited b...
hard
Yes 31 28 25 23 22 12 33 19 30 26 17 8 6 16 18 29 5 15 4 21 2 24 0 9 13 10 20 27 32 14 7 11 3 1
topology
34,376
In a directed graph with 26 nodes numbered from 0 to 25, node 0 should be visited before node 5 node 0 should be visited before node 22 node 0 should be visited before node 13 node 0 should be visited before node 12 node 0 should be visited before node 8 node 0 should be visited before node 17 node 0 should be visited ...
hard
Yes 0 5 2 13 22 12 3 8 24 23 14 17 10 11 20 6 15 7 16 25 4 18 21 1 19 9
topology
34,377
In a directed graph with 32 nodes numbered from 0 to 31, node 0 should be visited before node 24 node 1 should be visited before node 22 node 1 should be visited before node 9 node 1 should be visited before node 5 node 1 should be visited before node 29 node 1 should be visited before node 2 node 2 should be visited b...
hard
Yes 12 23 16 31 27 26 11 6 15 30 18 25 19 14 13 7 17 4 3 21 28 1 22 9 5 29 20 10 8 2 0 24
topology
34,378
In a directed graph with 30 nodes numbered from 0 to 29, node 1 should be visited before node 24 node 1 should be visited before node 25 node 1 should be visited before node 16 node 1 should be visited before node 14 node 2 should be visited before node 3 node 2 should be visited before node 9 node 2 should be visited ...
hard
Yes 27 6 5 7 20 21 18 26 11 4 10 19 12 2 3 9 17 15 22 28 23 29 1 25 24 8 16 13 14 0
topology
34,379
In a directed graph with 28 nodes numbered from 0 to 27, node 0 should be visited before node 22 node 0 should be visited before node 10 node 0 should be visited before node 2 node 0 should be visited before node 21 node 0 should be visited before node 9 node 0 should be visited before node 26 node 0 should be visited ...
hard
Yes 19 14 27 11 17 8 24 6 1 25 3 0 22 16 23 2 4 7 5 10 26 21 9 18 20 12 15 13
topology