question string | answer string |
|---|---|
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': '180 days', '5... | [datetime.timedelta(days=360), datetime.timedelta(days=360)] |
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', ... | [datetime.timedelta(seconds=5100), datetime.timedelta(seconds=5100)] |
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', ... | [datetime.timedelta(seconds=17100), datetime.timedelta(seconds=17100)] |
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', '... | [datetime.timedelta(days=1, seconds=1500), datetime.timedelta(days=1, seconds=1500)] |
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... | [datetime.timedelta(seconds=1920), datetime.timedelta(seconds=1920)] |
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', ... | [datetime.timedelta(seconds=2400), datetime.timedelta(seconds=2400)] |
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': ... | [datetime.timedelta(seconds=3780), datetime.timedelta(seconds=3780)] |
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': '5 seconds',... | [datetime.timedelta(seconds=360), datetime.timedelta(seconds=360)] |
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': '6... | [datetime.timedelta(days=1915, seconds=21600), datetime.timedelta(days=1915, seconds=21600)] |
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', ... | [datetime.timedelta(seconds=4200), datetime.timedelta(seconds=4200)] |
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... | [datetime.timedelta(seconds=6600), datetime.timedelta(seconds=6600)] |
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': '20 seconds', ... | [datetime.timedelta(seconds=280), datetime.timedelta(seconds=280)] |
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': '30 days', '2'... | [datetime.timedelta(days=1527), datetime.timedelta(days=1527)] |
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': '8 hours', '4'... | [datetime.timedelta(seconds=34800), datetime.timedelta(seconds=34800)] |
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', ... | [datetime.timedelta(days=1, seconds=4500), datetime.timedelta(days=1, seconds=4500)] |
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... | [datetime.timedelta(seconds=2820), datetime.timedelta(seconds=2820)] |
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': '730 days', '2... | [datetime.timedelta(days=1820, seconds=3600), datetime.timedelta(days=1820, seconds=3600)] |
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': '7 days', '1':... | [datetime.timedelta(days=97, seconds=1200), datetime.timedelta(days=97, seconds=1200)] |
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... | [datetime.timedelta(days=420, seconds=32400), datetime.timedelta(days=420, seconds=32400)] |
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... | [datetime.timedelta(days=60, seconds=5100), datetime.timedelta(days=60, seconds=5100)] |
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': '60 days', '4'... | [datetime.timedelta(days=150, seconds=120), datetime.timedelta(days=150, seconds=120)] |
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': ... | [datetime.timedelta(seconds=3300), datetime.timedelta(seconds=3300)] |
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': '2 hours', '3'... | [datetime.timedelta(days=1, seconds=7200), datetime.timedelta(days=1, seconds=7200)] |
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', '... | [datetime.timedelta(seconds=5460), datetime.timedelta(seconds=5460)] |
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', ... | [datetime.timedelta(seconds=3300), datetime.timedelta(seconds=3300)] |
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... | [datetime.timedelta(seconds=1320), datetime.timedelta(seconds=1320)] |
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': '2... | [datetime.timedelta(days=1095, seconds=18060), datetime.timedelta(days=1095, seconds=18060)] |
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... | [datetime.timedelta(days=244, seconds=7200), datetime.timedelta(days=244, seconds=7200)] |
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... | [datetime.timedelta(seconds=2280), datetime.timedelta(seconds=2280)] |
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... | [datetime.timedelta(seconds=8100), datetime.timedelta(seconds=8100)] |
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... | [datetime.timedelta(seconds=2220), datetime.timedelta(seconds=2220)] |
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': '1 days', '5':... | [datetime.timedelta(days=18), datetime.timedelta(days=18)] |
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 ... | [datetime.timedelta(days=35, seconds=10800), datetime.timedelta(days=35, seconds=10800)] |
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': '3... | [datetime.timedelta(seconds=360), datetime.timedelta(seconds=360)] |
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... | [datetime.timedelta(seconds=6720), datetime.timedelta(seconds=6720)] |
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', '... | [datetime.timedelta(seconds=7320), datetime.timedelta(seconds=7320)] |
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': '30 seconds', ... | [datetime.timedelta(days=736, seconds=30), datetime.timedelta(days=736, seconds=30)] |
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... | [datetime.timedelta(seconds=790), datetime.timedelta(seconds=790)] |
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... | [datetime.timedelta(seconds=15600), datetime.timedelta(seconds=15600)] |
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... | [datetime.timedelta(seconds=1620), datetime.timedelta(seconds=1620)] |
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', ... | [datetime.timedelta(seconds=4200), datetime.timedelta(seconds=4200)] |
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': '3650... | [datetime.timedelta(days=3650, seconds=21600), datetime.timedelta(days=3650, seconds=21600)] |
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... | [datetime.timedelta(seconds=9000), datetime.timedelta(seconds=9000)] |
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', ... | [datetime.timedelta(seconds=9000), datetime.timedelta(seconds=9000)] |
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', ... | [datetime.timedelta(seconds=1320), datetime.timedelta(seconds=1320)] |
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', ... | [datetime.timedelta(days=60, seconds=600), datetime.timedelta(days=60, seconds=600)] |
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',... | [datetime.timedelta(seconds=1800), datetime.timedelta(seconds=1800)] |
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... | [datetime.timedelta(seconds=2880), datetime.timedelta(seconds=2880)] |
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', '... | [datetime.timedelta(seconds=2700), datetime.timedelta(seconds=2700)] |
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... | [datetime.timedelta(seconds=540), datetime.timedelta(seconds=540)] |
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... | [datetime.timedelta(seconds=1500), datetime.timedelta(seconds=1500)] |
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': '7 days', '1':... | [datetime.timedelta(days=22), datetime.timedelta(days=22)] |
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... | [datetime.timedelta(days=30, seconds=6900), datetime.timedelta(days=30, seconds=6900)] |
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... | [datetime.timedelta(days=13, seconds=32400), datetime.timedelta(days=13, seconds=32400)] |
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... | [datetime.timedelta(days=7, seconds=1800), datetime.timedelta(days=7, seconds=1800)] |
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 ... | [datetime.timedelta(days=365, seconds=2100), datetime.timedelta(days=365, seconds=2100)] |
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... | [datetime.timedelta(seconds=1140), datetime.timedelta(seconds=1140)] |
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... | [datetime.timedelta(seconds=5400), datetime.timedelta(seconds=5400)] |
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... | [datetime.timedelta(days=3100), datetime.timedelta(days=3100)] |
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', '... | [datetime.timedelta(seconds=5700), datetime.timedelta(seconds=5700)] |
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... | [datetime.timedelta(seconds=7330), datetime.timedelta(seconds=7330)] |
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 ... | [datetime.timedelta(seconds=14400), datetime.timedelta(seconds=14400)] |
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': ... | [datetime.timedelta(days=3, seconds=21600), datetime.timedelta(days=3, seconds=21600)] |
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': '20 days', '3'... | [datetime.timedelta(days=30, seconds=7200), datetime.timedelta(days=30, seconds=7200)] |
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', '... | [datetime.timedelta(seconds=602), datetime.timedelta(seconds=602)] |
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... | [datetime.timedelta(days=6), datetime.timedelta(days=6)] |
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... | [datetime.timedelta(seconds=495), datetime.timedelta(seconds=495)] |
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... | [datetime.timedelta(seconds=6000), datetime.timedelta(seconds=6000)] |
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... | [datetime.timedelta(seconds=8400), datetime.timedelta(seconds=8400)] |
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... | [datetime.timedelta(days=95), datetime.timedelta(days=95)] |
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... | [datetime.timedelta(seconds=15660), datetime.timedelta(seconds=15660)] |
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... | [datetime.timedelta(seconds=15031), datetime.timedelta(seconds=15031)] |
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 ... | [datetime.timedelta(seconds=23400), datetime.timedelta(seconds=23400)] |
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... | [datetime.timedelta(days=3, seconds=5400), datetime.timedelta(days=3, seconds=5400)] |
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... | [datetime.timedelta(seconds=18960), datetime.timedelta(seconds=18960)] |
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... | [datetime.timedelta(seconds=57600), datetime.timedelta(seconds=57600)] |
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... | [datetime.timedelta(days=30), datetime.timedelta(days=30)] |
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': '1 days', '3':... | [datetime.timedelta(days=3, seconds=10800), datetime.timedelta(days=3, seconds=10800)] |
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... | [datetime.timedelta(seconds=4200), datetime.timedelta(seconds=4200)] |
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': '1 days', '1':... | [datetime.timedelta(days=4, seconds=2700), datetime.timedelta(days=4, seconds=2700)] |
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', ... | [datetime.timedelta(seconds=5100), datetime.timedelta(seconds=5100)] |
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 ... | [datetime.timedelta(seconds=1740), datetime.timedelta(seconds=1740)] |
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... | [datetime.timedelta(seconds=22080), datetime.timedelta(seconds=22080)] |
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... | [datetime.timedelta(days=30, seconds=21600), datetime.timedelta(days=30, seconds=21600)] |
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... | [datetime.timedelta(seconds=740), datetime.timedelta(seconds=740)] |
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': '1 hours', '... | [datetime.timedelta(seconds=21600), datetime.timedelta(seconds=21600)] |
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',... | [datetime.timedelta(seconds=1200), datetime.timedelta(seconds=1200)] |
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... | [datetime.timedelta(seconds=4680), datetime.timedelta(seconds=4680)] |
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', ... | [datetime.timedelta(seconds=19500), datetime.timedelta(seconds=19500)] |
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... | [datetime.timedelta(days=3, seconds=43200), datetime.timedelta(days=3, seconds=43200)] |
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... | [datetime.timedelta(seconds=3960), datetime.timedelta(seconds=3960)] |
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... | [datetime.timedelta(seconds=2160), datetime.timedelta(seconds=2160)] |
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', ... | [datetime.timedelta(seconds=3900), datetime.timedelta(seconds=3900)] |
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... | [datetime.timedelta(seconds=10200), datetime.timedelta(seconds=10200)] |
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', ... | [datetime.timedelta(seconds=7200), datetime.timedelta(seconds=7200)] |
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... | [datetime.timedelta(seconds=13200), datetime.timedelta(seconds=13200)] |
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... | [datetime.timedelta(seconds=660), datetime.timedelta(seconds=660)] |
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... | [datetime.timedelta(days=1, seconds=600), datetime.timedelta(days=1, seconds=600)] |
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... | [datetime.timedelta(seconds=4920), datetime.timedelta(seconds=4920)] |
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': '5 days', '5':... | [datetime.timedelta(days=19, seconds=9000), datetime.timedelta(days=19, seconds=9000)] |
End of preview. Expand in Data Studio
No dataset card yet
- Downloads last month
- 72