Datasets:
source_row int64 0 1.37k | question stringlengths 569 1.1k | answer float64 0.04 21M | source_answer stringlengths 56 92 |
|---|---|---|---|
0 | You have a graph whose adjacency list representation is as follows:
{'1': ['2', '3'], '2': ['4'], '3': ['4'], '4': ['5'], '5': ['END'], 'END': [], 'START': ['1']}
The graph is a directed graph, and the nodes are labelled as follows (START and END are special nodes which takes no time to traverse):
{'1': '259200 minute... | 518,400 | [datetime.timedelta(days=360), datetime.timedelta(days=360)] |
1 | You have a graph whose adjacency list representation is as follows:
{'1': ['5'], '2': ['3'], '3': ['4'], '4': ['5'], '5': ['END'], 'END': [], 'START': ['1', '2']}
The graph is a directed graph, and the nodes are labelled as follows (START and END are special nodes which takes no time to traverse):
{'3': '15 minutes', ... | 85 | [datetime.timedelta(seconds=5100), datetime.timedelta(seconds=5100)] |
2 | You have a graph whose adjacency list representation is as follows:
{'1': ['2'], '2': ['4', '3'], '3': ['5'], '4': ['5'], '5': ['END'], 'END': [], 'START': ['1']}
The graph is a directed graph, and the nodes are labelled as follows (START and END are special nodes which takes no time to traverse):
{'1': '15 minutes', ... | 285 | [datetime.timedelta(seconds=17100), datetime.timedelta(seconds=17100)] |
3 | You have a graph whose adjacency list representation is as follows:
{'1': ['2'], '2': ['3'], '3': ['5'], '4': ['2'], '5': ['END'], 'END': [], 'START': ['1', '4']}
The graph is a directed graph, and the nodes are labelled as follows (START and END are special nodes which takes no time to traverse):
{'2': '5 minutes', '... | 1,465 | [datetime.timedelta(days=1, seconds=1500), datetime.timedelta(days=1, seconds=1500)] |
4 | You have a graph whose adjacency list representation is as follows:
{'1': ['4'], '2': ['3'], '3': ['4'], '4': ['5'], '5': ['6'], '6': ['END'], 'END': [], 'START': ['1', '2']}
The graph is a directed graph, and the nodes are labelled as follows (START and END are special nodes which takes no time to traverse):
{'5': '1... | 32 | [datetime.timedelta(seconds=1920), datetime.timedelta(seconds=1920)] |
5 | You have a graph whose adjacency list representation is as follows:
{'1': ['3'], '2': ['3'], '3': ['4'], '4': ['5'], '5': ['END'], 'END': [], 'START': ['1', '2']}
The graph is a directed graph, and the nodes are labelled as follows (START and END are special nodes which takes no time to traverse):
{'5': '10 minutes', ... | 40 | [datetime.timedelta(seconds=2400), datetime.timedelta(seconds=2400)] |
6 | You have a graph whose adjacency list representation is as follows:
{'1': ['2'], '2': ['3'], '3': ['4'], '4': ['6', '5'], '5': ['END'], '6': ['END'], 'END': [], 'START': ['1']}
The graph is a directed graph, and the nodes are labelled as follows (START and END are special nodes which takes no time to traverse):
{'2': ... | 63 | [datetime.timedelta(seconds=3780), datetime.timedelta(seconds=3780)] |
7 | You have a graph whose adjacency list representation is as follows:
{'1': ['3', '2'], '2': ['4'], '3': ['END'], '4': ['5'], '5': ['END'], 'END': [], 'START': ['1']}
The graph is a directed graph, and the nodes are labelled as follows (START and END are special nodes which takes no time to traverse):
{'4': '0.08 minute... | 6 | [datetime.timedelta(seconds=360), datetime.timedelta(seconds=360)] |
8 | You have a graph whose adjacency list representation is as follows:
{'1': ['5'], '2': ['3'], '3': ['4'], '4': ['END'], '5': ['6', '2'], '6': ['3'], 'END': [], 'START': ['1']}
The graph is a directed graph, and the nodes are labelled as follows (START and END are special nodes which takes no time to traverse):
{'1': '3... | 2,757,960 | [datetime.timedelta(days=1915, seconds=21600), datetime.timedelta(days=1915, seconds=21600)] |
9 | You have a graph whose adjacency list representation is as follows:
{'1': ['2', '3'], '2': ['4'], '3': ['4'], '4': ['5'], '5': ['END'], 'END': [], 'START': ['1']}
The graph is a directed graph, and the nodes are labelled as follows (START and END are special nodes which takes no time to traverse):
{'1': '15 minutes', ... | 70 | [datetime.timedelta(seconds=4200), datetime.timedelta(seconds=4200)] |
10 | You have a graph whose adjacency list representation is as follows:
{'1': ['3'], '2': ['3'], '3': ['4'], '4': ['5'], '5': ['6'], '6': ['END'], 'END': [], 'START': ['1', '2']}
The graph is a directed graph, and the nodes are labelled as follows (START and END are special nodes which takes no time to traverse):
{'6': '3... | 110 | [datetime.timedelta(seconds=6600), datetime.timedelta(seconds=6600)] |
11 | You have a graph whose adjacency list representation is as follows:
{'1': ['2', '3'], '2': ['4'], '3': ['4'], '4': ['5'], '5': ['END'], 'END': [], 'START': ['1']}
The graph is a directed graph, and the nodes are labelled as follows (START and END are special nodes which takes no time to traverse):
{'3': '0.33 minutes'... | 4.66 | [datetime.timedelta(seconds=280), datetime.timedelta(seconds=280)] |
12 | You have a graph whose adjacency list representation is as follows:
{'1': ['2', '3'], '2': ['4'], '3': ['4'], '4': ['5'], '5': ['END'], 'END': [], 'START': ['1']}
The graph is a directed graph, and the nodes are labelled as follows (START and END are special nodes which takes no time to traverse):
{'5': '43200 minutes... | 2,198,880 | [datetime.timedelta(days=1527), datetime.timedelta(days=1527)] |
13 | You have a graph whose adjacency list representation is as follows:
{'1': ['2', '3'], '2': ['4'], '3': ['4'], '4': ['5'], '5': ['END'], 'END': [], 'START': ['1']}
The graph is a directed graph, and the nodes are labelled as follows (START and END are special nodes which takes no time to traverse):
{'5': '480 minutes',... | 580 | [datetime.timedelta(seconds=34800), datetime.timedelta(seconds=34800)] |
14 | You have a graph whose adjacency list representation is as follows:
{'1': ['2', '3'], '2': ['4'], '3': ['4'], '4': ['5'], '5': ['END'], 'END': [], 'START': ['1']}
The graph is a directed graph, and the nodes are labelled as follows (START and END are special nodes which takes no time to traverse):
{'5': '10 minutes', ... | 1,515 | [datetime.timedelta(days=1, seconds=4500), datetime.timedelta(days=1, seconds=4500)] |
15 | You have a graph whose adjacency list representation is as follows:
{'1': ['3'], '2': ['3'], '3': ['4'], '4': ['5'], '5': ['6'], '6': ['END'], 'END': [], 'START': ['1', '2']}
The graph is a directed graph, and the nodes are labelled as follows (START and END are special nodes which takes no time to traverse):
{'3': '5... | 47 | [datetime.timedelta(seconds=2820), datetime.timedelta(seconds=2820)] |
16 | You have a graph whose adjacency list representation is as follows:
{'1': ['2', '3'], '2': ['4'], '3': ['4'], '4': ['5'], '5': ['END'], 'END': [], 'START': ['1']}
The graph is a directed graph, and the nodes are labelled as follows (START and END are special nodes which takes no time to traverse):
{'5': '1051200 minut... | 2,620,860 | [datetime.timedelta(days=1820, seconds=3600), datetime.timedelta(days=1820, seconds=3600)] |
17 | You have a graph whose adjacency list representation is as follows:
{'1': ['2', '3'], '2': ['4'], '3': ['4'], '4': ['5'], '5': ['END'], 'END': [], 'START': ['1']}
The graph is a directed graph, and the nodes are labelled as follows (START and END are special nodes which takes no time to traverse):
{'5': '10080 minutes... | 139,700 | [datetime.timedelta(days=97, seconds=1200), datetime.timedelta(days=97, seconds=1200)] |
18 | You have a graph whose adjacency list representation is as follows:
{'1': ['2', '3'], '2': ['4'], '3': ['4'], '4': ['6', '5'], '5': ['7'], '6': ['7'], '7': ['END'], 'END': [], 'START': ['1']}
The graph is a directed graph, and the nodes are labelled as follows (START and END are special nodes which takes no time to tr... | 605,340 | [datetime.timedelta(days=420, seconds=32400), datetime.timedelta(days=420, seconds=32400)] |
19 | You have a graph whose adjacency list representation is as follows:
{'1': ['2', '3'], '2': ['4'], '3': ['4'], '4': ['5'], '5': ['6'], '6': ['7'], '7': ['END'], 'END': [], 'START': ['1']}
The graph is a directed graph, and the nodes are labelled as follows (START and END are special nodes which takes no time to travers... | 86,485 | [datetime.timedelta(days=60, seconds=5100), datetime.timedelta(days=60, seconds=5100)] |
20 | You have a graph whose adjacency list representation is as follows:
{'1': ['2'], '2': ['4', '3'], '3': ['5'], '4': ['5'], '5': ['END'], 'END': [], 'START': ['1']}
The graph is a directed graph, and the nodes are labelled as follows (START and END are special nodes which takes no time to traverse):
{'5': '86400 minutes... | 216,002 | [datetime.timedelta(days=150, seconds=120), datetime.timedelta(days=150, seconds=120)] |
21 | You have a graph whose adjacency list representation is as follows:
{'1': ['2'], '2': ['3'], '3': ['4'], '4': ['6', '5'], '5': ['END'], '6': ['END'], 'END': [], 'START': ['1']}
The graph is a directed graph, and the nodes are labelled as follows (START and END are special nodes which takes no time to traverse):
{'6': ... | 55 | [datetime.timedelta(seconds=3300), datetime.timedelta(seconds=3300)] |
22 | You have a graph whose adjacency list representation is as follows:
{'1': ['4'], '2': ['3'], '3': ['END'], '4': ['5'], '5': ['3'], 'END': [], 'START': ['1', '2']}
The graph is a directed graph, and the nodes are labelled as follows (START and END are special nodes which takes no time to traverse):
{'2': '120 minutes',... | 1,560 | [datetime.timedelta(days=1, seconds=7200), datetime.timedelta(days=1, seconds=7200)] |
23 | You have a graph whose adjacency list representation is as follows:
{'1': ['5'], '2': ['3'], '3': ['4'], '4': ['5'], '5': ['END'], 'END': [], 'START': ['1', '2']}
The graph is a directed graph, and the nodes are labelled as follows (START and END are special nodes which takes no time to traverse):
{'2': '1 minutes', '... | 91 | [datetime.timedelta(seconds=5460), datetime.timedelta(seconds=5460)] |
24 | You have a graph whose adjacency list representation is as follows:
{'1': ['3'], '2': ['3'], '3': ['4'], '4': ['5'], '5': ['END'], 'END': [], 'START': ['1', '2']}
The graph is a directed graph, and the nodes are labelled as follows (START and END are special nodes which takes no time to traverse):
{'5': '15 minutes', ... | 55 | [datetime.timedelta(seconds=3300), datetime.timedelta(seconds=3300)] |
25 | You have a graph whose adjacency list representation is as follows:
{'1': ['2'], '2': ['3'], '3': ['4', '5'], '4': ['6'], '5': ['6'], '6': ['END'], 'END': [], 'START': ['1']}
The graph is a directed graph, and the nodes are labelled as follows (START and END are special nodes which takes no time to traverse):
{'2': '3... | 22 | [datetime.timedelta(seconds=1320), datetime.timedelta(seconds=1320)] |
26 | You have a graph whose adjacency list representation is as follows:
{'1': ['2'], '2': ['4', '3'], '3': ['5'], '4': ['5'], '5': ['6'], '6': ['END'], 'END': [], 'START': ['1']}
The graph is a directed graph, and the nodes are labelled as follows (START and END are special nodes which takes no time to traverse):
{'1': '1... | 1,577,101 | [datetime.timedelta(days=1095, seconds=18060), datetime.timedelta(days=1095, seconds=18060)] |
27 | You have a graph whose adjacency list representation is as follows:
{'1': ['3'], '2': ['3'], '3': ['4'], '4': ['5'], '5': ['6'], '6': ['END'], 'END': [], 'START': ['1', '2']}
The graph is a directed graph, and the nodes are labelled as follows (START and END are special nodes which takes no time to traverse):
{'4': '1... | 351,480 | [datetime.timedelta(days=244, seconds=7200), datetime.timedelta(days=244, seconds=7200)] |
28 | You have a graph whose adjacency list representation is as follows:
{'1': ['2', '3'], '2': ['4'], '3': ['4'], '4': ['5'], '5': ['6'], '6': ['END'], 'END': [], 'START': ['1']}
The graph is a directed graph, and the nodes are labelled as follows (START and END are special nodes which takes no time to traverse):
{'4': '5... | 38 | [datetime.timedelta(seconds=2280), datetime.timedelta(seconds=2280)] |
29 | You have a graph whose adjacency list representation is as follows:
{'1': ['5'], '2': ['3'], '3': ['4'], '4': ['END'], '5': ['6'], '6': ['7'], '7': ['END'], 'END': [], 'START': ['1', '2']}
The graph is a directed graph, and the nodes are labelled as follows (START and END are special nodes which takes no time to trave... | 135 | [datetime.timedelta(seconds=8100), datetime.timedelta(seconds=8100)] |
30 | You have a graph whose adjacency list representation is as follows:
{'1': ['3'], '2': ['3'], '3': ['4'], '4': ['END'], '5': ['3'], 'END': [], 'START': ['1', '2', '5']}
The graph is a directed graph, and the nodes are labelled as follows (START and END are special nodes which takes no time to traverse):
{'2': '2 minute... | 37 | [datetime.timedelta(seconds=2220), datetime.timedelta(seconds=2220)] |
31 | You have a graph whose adjacency list representation is as follows:
{'1': ['3'], '2': ['3'], '3': ['4'], '4': ['5'], '5': ['END'], 'END': [], 'START': ['1', '2']}
The graph is a directed graph, and the nodes are labelled as follows (START and END are special nodes which takes no time to traverse):
{'2': '1440 minutes'... | 25,920 | [datetime.timedelta(days=18), datetime.timedelta(days=18)] |
32 | You have a graph whose adjacency list representation is as follows:
{'1': ['3'], '2': ['3'], '3': ['4'], '4': ['5'], '5': ['6', '7'], '6': ['END'], '7': ['END'], 'END': [], 'START': ['1', '2']}
The graph is a directed graph, and the nodes are labelled as follows (START and END are special nodes which takes no time to ... | 50,580 | [datetime.timedelta(days=35, seconds=10800), datetime.timedelta(days=35, seconds=10800)] |
33 | You have a graph whose adjacency list representation is as follows:
{'1': ['2'], '2': ['3'], '3': ['6'], '4': ['5'], '5': ['3'], '6': ['END'], 'END': [], 'START': ['1', '4']}
The graph is a directed graph, and the nodes are labelled as follows (START and END are special nodes which takes no time to traverse):
{'1': '0... | 6 | [datetime.timedelta(seconds=360), datetime.timedelta(seconds=360)] |
34 | You have a graph whose adjacency list representation is as follows:
{'1': ['2', '4', '3'], '2': ['5'], '3': ['5'], '4': ['5'], '5': ['6'], '6': ['7'], '7': ['END'], 'END': [], 'START': ['1']}
The graph is a directed graph, and the nodes are labelled as follows (START and END are special nodes which takes no time to tr... | 112 | [datetime.timedelta(seconds=6720), datetime.timedelta(seconds=6720)] |
35 | You have a graph whose adjacency list representation is as follows:
{'1': ['2'], '2': ['3'], '3': ['5'], '4': ['2'], '5': ['END'], 'END': [], 'START': ['1', '4']}
The graph is a directed graph, and the nodes are labelled as follows (START and END are special nodes which takes no time to traverse):
{'2': '1 minutes', '... | 122 | [datetime.timedelta(seconds=7320), datetime.timedelta(seconds=7320)] |
36 | You have a graph whose adjacency list representation is as follows:
{'1': ['3'], '2': ['3'], '3': ['4'], '4': ['5'], '5': ['END'], 'END': [], 'START': ['1', '2']}
The graph is a directed graph, and the nodes are labelled as follows (START and END are special nodes which takes no time to traverse):
{'5': '0.50 minutes'... | 1,059,840.5 | [datetime.timedelta(days=736, seconds=30), datetime.timedelta(days=736, seconds=30)] |
37 | You have a graph whose adjacency list representation is as follows:
{'1': ['2'], '2': ['3'], '3': ['4', '5'], '4': ['6'], '5': ['6'], '6': ['END'], 'END': [], 'START': ['1']}
The graph is a directed graph, and the nodes are labelled as follows (START and END are special nodes which takes no time to traverse):
{'2': '1... | 13.16 | [datetime.timedelta(seconds=790), datetime.timedelta(seconds=790)] |
38 | You have a graph whose adjacency list representation is as follows:
{'1': ['2'], '2': ['3'], '3': ['4'], '4': ['6', '5'], '5': ['7'], '6': ['7'], '7': ['END'], 'END': [], 'START': ['1']}
The graph is a directed graph, and the nodes are labelled as follows (START and END are special nodes which takes no time to travers... | 260 | [datetime.timedelta(seconds=15600), datetime.timedelta(seconds=15600)] |
39 | You have a graph whose adjacency list representation is as follows:
{'1': ['3'], '2': ['3'], '3': ['4'], '4': ['5'], '5': ['6'], '6': ['END'], 'END': [], 'START': ['1', '2']}
The graph is a directed graph, and the nodes are labelled as follows (START and END are special nodes which takes no time to traverse):
{'3': '1... | 27 | [datetime.timedelta(seconds=1620), datetime.timedelta(seconds=1620)] |
40 | You have a graph whose adjacency list representation is as follows:
{'1': ['3'], '2': ['3'], '3': ['4'], '4': ['5'], '5': ['END'], 'END': [], 'START': ['1', '2']}
The graph is a directed graph, and the nodes are labelled as follows (START and END are special nodes which takes no time to traverse):
{'4': '15 minutes', ... | 70 | [datetime.timedelta(seconds=4200), datetime.timedelta(seconds=4200)] |
41 | You have a graph whose adjacency list representation is as follows:
{'1': ['5'], '2': ['END'], '3': ['END'], '4': ['END'], '5': ['4', '3', '2'], 'END': [], 'START': ['1']}
The graph is a directed graph, and the nodes are labelled as follows (START and END are special nodes which takes no time to traverse):
{'4': '5256... | 5,256,360 | [datetime.timedelta(days=3650, seconds=21600), datetime.timedelta(days=3650, seconds=21600)] |
42 | You have a graph whose adjacency list representation is as follows:
{'1': ['2'], '2': ['3'], '3': ['4'], '4': ['END'], '5': ['6'], '6': ['2'], '7': ['5'], 'END': [], 'START': ['1', '7']}
The graph is a directed graph, and the nodes are labelled as follows (START and END are special nodes which takes no time to travers... | 150 | [datetime.timedelta(seconds=9000), datetime.timedelta(seconds=9000)] |
43 | You have a graph whose adjacency list representation is as follows:
{'1': ['3'], '2': ['3'], '3': ['4'], '4': ['5'], '5': ['END'], 'END': [], 'START': ['1', '2']}
The graph is a directed graph, and the nodes are labelled as follows (START and END are special nodes which takes no time to traverse):
{'1': '20 minutes', ... | 150 | [datetime.timedelta(seconds=9000), datetime.timedelta(seconds=9000)] |
44 | You have a graph whose adjacency list representation is as follows:
{'1': ['2'], '2': ['4', '3'], '3': ['5'], '4': ['5'], '5': ['END'], 'END': [], 'START': ['1']}
The graph is a directed graph, and the nodes are labelled as follows (START and END are special nodes which takes no time to traverse):
{'2': '15 minutes', ... | 22 | [datetime.timedelta(seconds=1320), datetime.timedelta(seconds=1320)] |
45 | You have a graph whose adjacency list representation is as follows:
{'1': ['2'], '2': ['3'], '3': ['END'], '4': ['5'], '5': ['3'], 'END': [], 'START': ['1', '4']}
The graph is a directed graph, and the nodes are labelled as follows (START and END are special nodes which takes no time to traverse):
{'2': '30 minutes', ... | 86,410 | [datetime.timedelta(days=60, seconds=600), datetime.timedelta(days=60, seconds=600)] |
46 | You have a graph whose adjacency list representation is as follows:
{'1': ['2'], '2': ['3'], '3': ['5'], '4': ['END'], '5': ['END'], 'END': [], 'START': ['1', '4']}
The graph is a directed graph, and the nodes are labelled as follows (START and END are special nodes which takes no time to traverse):
{'2': '1 minutes',... | 30 | [datetime.timedelta(seconds=1800), datetime.timedelta(seconds=1800)] |
47 | You have a graph whose adjacency list representation is as follows:
{'1': ['2', '4', '3'], '2': ['5'], '3': ['5'], '4': ['5'], '5': ['6'], '6': ['7'], '7': ['END'], 'END': [], 'START': ['1']}
The graph is a directed graph, and the nodes are labelled as follows (START and END are special nodes which takes no time to tr... | 48 | [datetime.timedelta(seconds=2880), datetime.timedelta(seconds=2880)] |
48 | You have a graph whose adjacency list representation is as follows:
{'1': ['2', '3'], '2': ['4'], '3': ['4'], '4': ['5'], '5': ['END'], 'END': [], 'START': ['1']}
The graph is a directed graph, and the nodes are labelled as follows (START and END are special nodes which takes no time to traverse):
{'1': '5 minutes', '... | 45 | [datetime.timedelta(seconds=2700), datetime.timedelta(seconds=2700)] |
49 | You have a graph whose adjacency list representation is as follows:
{'1': ['2'], '2': ['4', '3'], '3': ['5'], '4': ['5'], '5': ['6'], '6': ['7'], '7': ['END'], 'END': [], 'START': ['1']}
The graph is a directed graph, and the nodes are labelled as follows (START and END are special nodes which takes no time to travers... | 9 | [datetime.timedelta(seconds=540), datetime.timedelta(seconds=540)] |
50 | You have a graph whose adjacency list representation is as follows:
{'1': ['6'], '2': ['3'], '3': ['4'], '4': ['5'], '5': ['7'], '6': ['4'], '7': ['END'], 'END': [], 'START': ['1', '2']}
The graph is a directed graph, and the nodes are labelled as follows (START and END are special nodes which takes no time to travers... | 25 | [datetime.timedelta(seconds=1500), datetime.timedelta(seconds=1500)] |
51 | You have a graph whose adjacency list representation is as follows:
{'1': ['2', '3'], '2': ['4'], '3': ['4'], '4': ['5'], '5': ['END'], 'END': [], 'START': ['1']}
The graph is a directed graph, and the nodes are labelled as follows (START and END are special nodes which takes no time to traverse):
{'4': '10080 minutes... | 31,680 | [datetime.timedelta(days=22), datetime.timedelta(days=22)] |
52 | You have a graph whose adjacency list representation is as follows:
{'1': ['2', '3'], '2': ['4'], '3': ['4'], '4': ['5'], '5': ['6'], '6': ['END'], 'END': [], 'START': ['1']}
The graph is a directed graph, and the nodes are labelled as follows (START and END are special nodes which takes no time to traverse):
{'6': '3... | 43,315 | [datetime.timedelta(days=30, seconds=6900), datetime.timedelta(days=30, seconds=6900)] |
53 | You have a graph whose adjacency list representation is as follows:
{'1': ['2'], '2': ['3'], '3': ['4', '5'], '4': ['6'], '5': ['6'], '6': ['END'], 'END': [], 'START': ['1']}
The graph is a directed graph, and the nodes are labelled as follows (START and END are special nodes which takes no time to traverse):
{'5': '1... | 19,260 | [datetime.timedelta(days=13, seconds=32400), datetime.timedelta(days=13, seconds=32400)] |
54 | You have a graph whose adjacency list representation is as follows:
{'1': ['3'], '2': ['3'], '3': ['END'], '4': ['5'], '5': ['3'], 'END': [], 'START': ['1', '2', '4']}
The graph is a directed graph, and the nodes are labelled as follows (START and END are special nodes which takes no time to traverse):
{'2': '30 minut... | 10,110 | [datetime.timedelta(days=7, seconds=1800), datetime.timedelta(days=7, seconds=1800)] |
55 | You have a graph whose adjacency list representation is as follows:
{'1': ['3'], '2': ['3'], '3': ['4'], '4': ['END'], '5': ['3'], '6': ['3'], '7': ['3'], 'END': [], 'START': ['1', '2', '5', '6', '7']}
The graph is a directed graph, and the nodes are labelled as follows (START and END are special nodes which takes no ... | 525,635 | [datetime.timedelta(days=365, seconds=2100), datetime.timedelta(days=365, seconds=2100)] |
56 | You have a graph whose adjacency list representation is as follows:
{'1': ['2', '3'], '2': ['4'], '3': ['4'], '4': ['5'], '5': ['6'], '6': ['7'], '7': ['END'], 'END': [], 'START': ['1']}
The graph is a directed graph, and the nodes are labelled as follows (START and END are special nodes which takes no time to travers... | 19 | [datetime.timedelta(seconds=1140), datetime.timedelta(seconds=1140)] |
57 | You have a graph whose adjacency list representation is as follows:
{'1': ['2'], '2': ['4', '3'], '3': ['5'], '4': ['5'], '5': ['6'], '6': ['7'], '7': ['END'], 'END': [], 'START': ['1']}
The graph is a directed graph, and the nodes are labelled as follows (START and END are special nodes which takes no time to travers... | 90 | [datetime.timedelta(seconds=5400), datetime.timedelta(seconds=5400)] |
58 | You have a graph whose adjacency list representation is as follows:
{'1': ['3'], '2': ['3'], '3': ['4'], '4': ['5'], '5': ['6'], '6': ['7'], '7': ['END'], 'END': [], 'START': ['1', '2']}
The graph is a directed graph, and the nodes are labelled as follows (START and END are special nodes which takes no time to travers... | 4,464,000 | [datetime.timedelta(days=3100), datetime.timedelta(days=3100)] |
59 | You have a graph whose adjacency list representation is as follows:
{'1': ['4'], '2': ['3'], '3': ['4'], '4': ['5'], '5': ['END'], 'END': [], 'START': ['1', '2']}
The graph is a directed graph, and the nodes are labelled as follows (START and END are special nodes which takes no time to traverse):
{'3': '5 minutes', '... | 95 | [datetime.timedelta(seconds=5700), datetime.timedelta(seconds=5700)] |
60 | You have a graph whose adjacency list representation is as follows:
{'1': ['4'], '2': ['3'], '3': ['4'], '4': ['5'], '5': ['7'], '6': ['4'], '7': ['END'], 'END': [], 'START': ['1', '2', '6']}
The graph is a directed graph, and the nodes are labelled as follows (START and END are special nodes which takes no time to tr... | 122.17 | [datetime.timedelta(seconds=7330), datetime.timedelta(seconds=7330)] |
61 | You have a graph whose adjacency list representation is as follows:
{'1': ['3'], '2': ['3'], '3': ['4'], '4': ['5'], '5': ['6', '7'], '6': ['END'], '7': ['END'], 'END': [], 'START': ['1', '2']}
The graph is a directed graph, and the nodes are labelled as follows (START and END are special nodes which takes no time to ... | 240 | [datetime.timedelta(seconds=14400), datetime.timedelta(seconds=14400)] |
62 | You have a graph whose adjacency list representation is as follows:
{'1': ['2'], '2': ['4', '3'], '3': ['5'], '4': ['6'], '5': ['END'], '6': ['END'], 'END': [], 'START': ['1']}
The graph is a directed graph, and the nodes are labelled as follows (START and END are special nodes which takes no time to traverse):
{'5': ... | 4,680 | [datetime.timedelta(days=3, seconds=21600), datetime.timedelta(days=3, seconds=21600)] |
63 | You have a graph whose adjacency list representation is as follows:
{'1': ['3'], '2': ['3'], '3': ['4'], '4': ['5'], '5': ['END'], 'END': [], 'START': ['1', '2']}
The graph is a directed graph, and the nodes are labelled as follows (START and END are special nodes which takes no time to traverse):
{'2': '28800 minutes... | 43,320 | [datetime.timedelta(days=30, seconds=7200), datetime.timedelta(days=30, seconds=7200)] |
64 | You have a graph whose adjacency list representation is as follows:
{'1': ['2', '3'], '2': ['4'], '3': ['4'], '4': ['5'], '5': ['END'], 'END': [], 'START': ['1']}
The graph is a directed graph, and the nodes are labelled as follows (START and END are special nodes which takes no time to traverse):
{'5': '5 minutes', '... | 10.04 | [datetime.timedelta(seconds=602), datetime.timedelta(seconds=602)] |
65 | You have a graph whose adjacency list representation is as follows:
{'1': ['3'], '2': ['3'], '3': ['END'], '4': ['3'], '5': ['3'], '6': ['3'], '7': ['3'], 'END': [], 'START': ['1', '2', '4', '5', '6', '7']}
The graph is a directed graph, and the nodes are labelled as follows (START and END are special nodes which take... | 8,640 | [datetime.timedelta(days=6), datetime.timedelta(days=6)] |
66 | You have a graph whose adjacency list representation is as follows:
{'1': ['3'], '2': ['3'], '3': ['4'], '4': ['6'], '5': ['3'], '6': ['7'], '7': ['END'], 'END': [], 'START': ['1', '2', '5']}
The graph is a directed graph, and the nodes are labelled as follows (START and END are special nodes which takes no time to tr... | 8.25 | [datetime.timedelta(seconds=495), datetime.timedelta(seconds=495)] |
67 | You have a graph whose adjacency list representation is as follows:
{'1': ['3'], '2': ['3'], '3': ['4'], '4': ['6'], '5': ['3'], '6': ['END'], 'END': [], 'START': ['1', '2', '5']}
The graph is a directed graph, and the nodes are labelled as follows (START and END are special nodes which takes no time to traverse):
{'3... | 100 | [datetime.timedelta(seconds=6000), datetime.timedelta(seconds=6000)] |
68 | You have a graph whose adjacency list representation is as follows:
{'1': ['3'], '2': ['3'], '3': ['4'], '4': ['6'], '5': ['3'], '6': ['END'], 'END': [], 'START': ['1', '2', '5']}
The graph is a directed graph, and the nodes are labelled as follows (START and END are special nodes which takes no time to traverse):
{'3... | 140 | [datetime.timedelta(seconds=8400), datetime.timedelta(seconds=8400)] |
69 | You have a graph whose adjacency list representation is as follows:
{'1': ['2'], '2': ['END'], '3': ['END'], '4': ['5'], '5': ['END'], '6': ['END'], 'END': [], 'START': ['1', '3', '4', '6']}
The graph is a directed graph, and the nodes are labelled as follows (START and END are special nodes which takes no time to tra... | 136,800 | [datetime.timedelta(days=95), datetime.timedelta(days=95)] |
70 | You have a graph whose adjacency list representation is as follows:
{'1': ['4'], '2': ['3'], '3': ['4'], '4': ['5'], '5': ['6'], '6': ['END'], 'END': [], 'START': ['1', '2']}
The graph is a directed graph, and the nodes are labelled as follows (START and END are special nodes which takes no time to traverse):
{'4': '5... | 261 | [datetime.timedelta(seconds=15660), datetime.timedelta(seconds=15660)] |
71 | You have a graph whose adjacency list representation is as follows:
{'1': ['2'], '2': ['4', '3'], '3': ['5'], '4': ['6'], '5': ['END'], '6': ['5'], 'END': [], 'START': ['1']}
The graph is a directed graph, and the nodes are labelled as follows (START and END are special nodes which takes no time to traverse):
{'2': '1... | 250.52 | [datetime.timedelta(seconds=15031), datetime.timedelta(seconds=15031)] |
72 | You have a graph whose adjacency list representation is as follows:
{'1': ['4'], '2': ['3'], '3': ['4'], '4': ['5'], '5': ['END'], '6': ['4'], '7': ['4'], 'END': [], 'START': ['1', '2', '6', '7']}
The graph is a directed graph, and the nodes are labelled as follows (START and END are special nodes which takes no time ... | 390 | [datetime.timedelta(seconds=23400), datetime.timedelta(seconds=23400)] |
73 | You have a graph whose adjacency list representation is as follows:
{'1': ['2'], '2': ['4', '3'], '3': ['5'], '4': ['5'], '5': ['6'], '6': ['END'], 'END': [], 'START': ['1']}
The graph is a directed graph, and the nodes are labelled as follows (START and END are special nodes which takes no time to traverse):
{'2': '2... | 4,410 | [datetime.timedelta(days=3, seconds=5400), datetime.timedelta(days=3, seconds=5400)] |
74 | You have a graph whose adjacency list representation is as follows:
{'1': ['7'], '2': ['3'], '3': ['4'], '4': ['5'], '5': ['6'], '6': ['7'], '7': ['END'], 'END': [], 'START': ['1', '2']}
The graph is a directed graph, and the nodes are labelled as follows (START and END are special nodes which takes no time to travers... | 316 | [datetime.timedelta(seconds=18960), datetime.timedelta(seconds=18960)] |
75 | You have a graph whose adjacency list representation is as follows:
{'1': ['6'], '2': ['4', '3'], '3': ['5'], '4': ['5'], '5': ['6'], '6': ['7'], '7': ['END'], 'END': [], 'START': ['1', '2']}
The graph is a directed graph, and the nodes are labelled as follows (START and END are special nodes which takes no time to tr... | 960 | [datetime.timedelta(seconds=57600), datetime.timedelta(seconds=57600)] |
76 | You have a graph whose adjacency list representation is as follows:
{'1': ['END'], '2': ['3'], '3': ['END'], '4': ['3'], '5': ['END'], '6': ['END'], '7': ['END'], 'END': [], 'START': ['1', '2', '4', '5', '6', '7']}
The graph is a directed graph, and the nodes are labelled as follows (START and END are special nodes wh... | 43,200 | [datetime.timedelta(days=30), datetime.timedelta(days=30)] |
77 | You have a graph whose adjacency list representation is as follows:
{'1': ['2'], '2': ['4', '3'], '3': ['5'], '4': ['5'], '5': ['END'], 'END': [], 'START': ['1']}
The graph is a directed graph, and the nodes are labelled as follows (START and END are special nodes which takes no time to traverse):
{'4': '1440 minutes'... | 4,500 | [datetime.timedelta(days=3, seconds=10800), datetime.timedelta(days=3, seconds=10800)] |
78 | You have a graph whose adjacency list representation is as follows:
{'1': ['5'], '2': ['3'], '3': ['4'], '4': ['5'], '5': ['END'], '6': ['4'], 'END': [], 'START': ['1', '2', '6']}
The graph is a directed graph, and the nodes are labelled as follows (START and END are special nodes which takes no time to traverse):
{'5... | 70 | [datetime.timedelta(seconds=4200), datetime.timedelta(seconds=4200)] |
79 | You have a graph whose adjacency list representation is as follows:
{'1': ['2'], '2': ['3'], '3': ['4'], '4': ['END'], '5': ['2'], 'END': [], 'START': ['1', '5']}
The graph is a directed graph, and the nodes are labelled as follows (START and END are special nodes which takes no time to traverse):
{'3': '1440 minutes'... | 5,805 | [datetime.timedelta(days=4, seconds=2700), datetime.timedelta(days=4, seconds=2700)] |
80 | You have a graph whose adjacency list representation is as follows:
{'1': ['2'], '2': ['3'], '3': ['END'], '4': ['5'], '5': ['2'], 'END': [], 'START': ['1', '4']}
The graph is a directed graph, and the nodes are labelled as follows (START and END are special nodes which takes no time to traverse):
{'5': '30 minutes', ... | 85 | [datetime.timedelta(seconds=5100), datetime.timedelta(seconds=5100)] |
81 | You have a graph whose adjacency list representation is as follows:
{'1': ['3'], '2': ['4', '3'], '3': ['5'], '4': ['6'], '5': ['END'], '6': ['5'], '7': ['4', '3'], 'END': [], 'START': ['1', '2', '7']}
The graph is a directed graph, and the nodes are labelled as follows (START and END are special nodes which takes no ... | 29 | [datetime.timedelta(seconds=1740), datetime.timedelta(seconds=1740)] |
82 | You have a graph whose adjacency list representation is as follows:
{'1': ['2'], '2': ['3'], '3': ['4'], '4': ['5', '7'], '5': ['6'], '6': ['END'], '7': ['6'], 'END': [], 'START': ['1']}
The graph is a directed graph, and the nodes are labelled as follows (START and END are special nodes which takes no time to travers... | 368 | [datetime.timedelta(seconds=22080), datetime.timedelta(seconds=22080)] |
83 | You have a graph whose adjacency list representation is as follows:
{'1': ['3'], '2': ['3'], '3': ['4'], '4': ['6'], '5': ['3'], '6': ['7'], '7': ['END'], 'END': [], 'START': ['1', '2', '5']}
The graph is a directed graph, and the nodes are labelled as follows (START and END are special nodes which takes no time to tr... | 43,560 | [datetime.timedelta(days=30, seconds=21600), datetime.timedelta(days=30, seconds=21600)] |
84 | You have a graph whose adjacency list representation is as follows:
{'1': ['2', '3'], '2': ['4'], '3': ['5'], '4': ['6'], '5': ['6'], '6': ['7'], '7': ['END'], 'END': [], 'START': ['1']}
The graph is a directed graph, and the nodes are labelled as follows (START and END are special nodes which takes no time to travers... | 12.34 | [datetime.timedelta(seconds=740), datetime.timedelta(seconds=740)] |
85 | You have a graph whose adjacency list representation is as follows:
{'1': ['2'], '2': ['3'], '3': ['4', '5'], '4': ['END'], '5': ['END'], 'END': [], 'START': ['1']}
The graph is a directed graph, and the nodes are labelled as follows (START and END are special nodes which takes no time to traverse):
{'4': '60 minutes'... | 360 | [datetime.timedelta(seconds=21600), datetime.timedelta(seconds=21600)] |
86 | You have a graph whose adjacency list representation is as follows:
{'1': ['3'], '2': ['END'], '3': ['4'], '4': ['2', '5'], '5': ['END'], 'END': [], 'START': ['1']}
The graph is a directed graph, and the nodes are labelled as follows (START and END are special nodes which takes no time to traverse):
{'3': '2 minutes',... | 20 | [datetime.timedelta(seconds=1200), datetime.timedelta(seconds=1200)] |
87 | You have a graph whose adjacency list representation is as follows:
{'1': ['2'], '2': ['3'], '3': ['4', '5'], '4': ['6'], '5': ['6'], '6': ['END'], 'END': [], 'START': ['1']}
The graph is a directed graph, and the nodes are labelled as follows (START and END are special nodes which takes no time to traverse):
{'5': '4... | 78 | [datetime.timedelta(seconds=4680), datetime.timedelta(seconds=4680)] |
88 | You have a graph whose adjacency list representation is as follows:
{'1': ['3'], '2': ['3'], '3': ['4'], '4': ['5'], '5': ['END'], 'END': [], 'START': ['1', '2']}
The graph is a directed graph, and the nodes are labelled as follows (START and END are special nodes which takes no time to traverse):
{'5': '25 minutes', ... | 325 | [datetime.timedelta(seconds=19500), datetime.timedelta(seconds=19500)] |
89 | You have a graph whose adjacency list representation is as follows:
{'1': ['2', '3'], '2': ['4'], '3': ['4'], '4': ['5'], '5': ['6'], '6': ['7'], '7': ['END'], 'END': [], 'START': ['1']}
The graph is a directed graph, and the nodes are labelled as follows (START and END are special nodes which takes no time to travers... | 5,040 | [datetime.timedelta(days=3, seconds=43200), datetime.timedelta(days=3, seconds=43200)] |
90 | You have a graph whose adjacency list representation is as follows:
{'1': ['2', '3'], '2': ['4'], '3': ['5'], '4': ['5'], '5': ['6'], '6': ['7'], '7': ['END'], 'END': [], 'START': ['1']}
The graph is a directed graph, and the nodes are labelled as follows (START and END are special nodes which takes no time to travers... | 66 | [datetime.timedelta(seconds=3960), datetime.timedelta(seconds=3960)] |
91 | You have a graph whose adjacency list representation is as follows:
{'1': ['6', '7'], '2': ['3'], '3': ['4'], '4': ['5'], '5': ['6', '7'], '6': ['END'], '7': ['END'], 'END': [], 'START': ['1', '2']}
The graph is a directed graph, and the nodes are labelled as follows (START and END are special nodes which takes no tim... | 36 | [datetime.timedelta(seconds=2160), datetime.timedelta(seconds=2160)] |
92 | You have a graph whose adjacency list representation is as follows:
{'1': ['3'], '2': ['3'], '3': ['4'], '4': ['5'], '5': ['END'], 'END': [], 'START': ['1', '2']}
The graph is a directed graph, and the nodes are labelled as follows (START and END are special nodes which takes no time to traverse):
{'4': '20 minutes', ... | 65 | [datetime.timedelta(seconds=3900), datetime.timedelta(seconds=3900)] |
93 | You have a graph whose adjacency list representation is as follows:
{'1': ['2'], '2': ['4', '3'], '3': ['5'], '4': ['5'], '5': ['6'], '6': ['END'], 'END': [], 'START': ['1']}
The graph is a directed graph, and the nodes are labelled as follows (START and END are special nodes which takes no time to traverse):
{'1': '1... | 170 | [datetime.timedelta(seconds=10200), datetime.timedelta(seconds=10200)] |
94 | You have a graph whose adjacency list representation is as follows:
{'1': ['2', '5'], '2': ['3'], '3': ['4'], '4': ['END'], '5': ['3'], 'END': [], 'START': ['1']}
The graph is a directed graph, and the nodes are labelled as follows (START and END are special nodes which takes no time to traverse):
{'1': '30 minutes', ... | 120 | [datetime.timedelta(seconds=7200), datetime.timedelta(seconds=7200)] |
95 | You have a graph whose adjacency list representation is as follows:
{'1': ['3'], '2': ['3'], '3': ['4'], '4': ['5'], '5': ['6'], '6': ['END'], 'END': [], 'START': ['1', '2']}
The graph is a directed graph, and the nodes are labelled as follows (START and END are special nodes which takes no time to traverse):
{'6': '3... | 220 | [datetime.timedelta(seconds=13200), datetime.timedelta(seconds=13200)] |
96 | You have a graph whose adjacency list representation is as follows:
{'1': ['7'], '2': ['3'], '3': ['4'], '4': ['5'], '5': ['6'], '6': ['END'], '7': ['5'], 'END': [], 'START': ['1', '2']}
The graph is a directed graph, and the nodes are labelled as follows (START and END are special nodes which takes no time to travers... | 11 | [datetime.timedelta(seconds=660), datetime.timedelta(seconds=660)] |
97 | You have a graph whose adjacency list representation is as follows:
{'1': ['6'], '2': ['3'], '3': ['4'], '4': ['5'], '5': ['7'], '6': ['7'], '7': ['END'], 'END': [], 'START': ['1', '2']}
The graph is a directed graph, and the nodes are labelled as follows (START and END are special nodes which takes no time to travers... | 1,450 | [datetime.timedelta(days=1, seconds=600), datetime.timedelta(days=1, seconds=600)] |
98 | You have a graph whose adjacency list representation is as follows:
{'1': ['5'], '2': ['3'], '3': ['4'], '4': ['5'], '5': ['6'], '6': ['7'], '7': ['END'], 'END': [], 'START': ['1', '2']}
The graph is a directed graph, and the nodes are labelled as follows (START and END are special nodes which takes no time to travers... | 82 | [datetime.timedelta(seconds=4920), datetime.timedelta(seconds=4920)] |
99 | You have a graph whose adjacency list representation is as follows:
{'1': ['2'], '2': ['4', '3'], '3': ['5'], '4': ['5'], '5': ['END'], 'END': [], 'START': ['1']}
The graph is a directed graph, and the nodes are labelled as follows (START and END are special nodes which takes no time to traverse):
{'3': '7200 minutes'... | 27,510 | [datetime.timedelta(days=19, seconds=9000), datetime.timedelta(days=19, seconds=9000)] |
End of preview. Expand in Data Studio
AsynChow Code-Aligned Minutes
This dataset is a unit-normalized variant of the AsynChow data released with
fangru-lin/procedure_generalization_llm,
pinned to source commit d9bf3485cd41c1050d33471d922c826f474efec1.
It contains three aligned representations of each weighted DAG scheduling problem:
natural: natural-language steps and precedence constraints;graph: adjacency-list and duration-dictionary representation;python: executable-style Python representation from the released Code data.
Each configuration contains 1,373 training examples and 225 test examples.
Rows remain aligned across configurations, and source_row identifies the
original row within each split.
Unit-alignment policy
- Durations in the Natural and Graph inputs are converted to minutes.
- Values use the same two-decimal rounding convention as the released Code representation.
- All three representations use the released Code numeric target.
- A month is treated as 30 days and a year as 365 days, matching the released Code generation rule.
- The upstream source files are not modified.
Schema
Each JSONL row contains:
source_row: zero-based row number in the upstream split;question: the aligned problem prompt;answer: the numeric answer in minutes;source_answer: the answer from the corresponding upstream representation.
Known rounding differences
The Code representation's two-decimal convention introduces quantization. The Code target differs from both exact Natural/Graph interval endpoints for 136 of 1,373 training examples and 16 of 225 test examples. It falls outside the released interval for 97 training examples and 12 test examples. These differences are intentionally retained to keep all representations aligned to the Code target.
See manifest.json for the complete conversion policy, source and generated
SHA-256 hashes, and audit counts. The conversion script is included as
prepare_code_aligned_minutes.py.
License and attribution
This repository is a transformed redistribution of the upstream AsynChow data. No explicit dataset license was available in the local pinned source materials when this variant was prepared. Users should review the upstream repository and obtain any permissions required for their intended use.
- Downloads last month
- 40