task
class label 5
classes | type
class label 2
classes | prompt
stringlengths 298
1.22k
| input
stringclasses 10
values | output
stringlengths 3
6
|
|---|---|---|---|---|
0diameter
| 0directed
| Given an undirected graph with edges (0, 1), (0, 3), (0, 4), (0, 9), (0, 15), (1, 10), (2, 4), (2, 8), (3, 6), (3, 8), (3, 13), (4, 15), (5, 6), (5, 8), (5, 12), (6, 12), (6, 14), (8, 9), (8, 15), (10, 11), (11, 12), (13, 14), what is its diameter, the length of the longest shortest path between any two nodes (None if the graph is not connected)? Return the answer in \boxed{} format. If the answer is a floating point number, round it to 2 decimal places. If the graph is not connected and the property is undefined, return 'None'. | {"task": "diameter", "samples": 40, "graph_type": "directed", "num_workers": 1} | "None" |
0diameter
| 0directed
| Given an undirected graph with edges (1, 15), (2, 11), (3, 8), (4, 7), (4, 8), (4, 15), (5, 13), (6, 14), (7, 17), (8, 11), (8, 17), (9, 15), (9, 16), (11, 16), (13, 14), what is its diameter, the length of the longest shortest path between any two nodes (None if the graph is not connected)? Return the answer in \boxed{} format. If the answer is a floating point number, round it to 2 decimal places. If the graph is not connected and the property is undefined, return 'None'. | {"task": "diameter", "samples": 40, "graph_type": "directed", "num_workers": 1} | "None" |
0diameter
| 0directed
| Given an undirected graph with edges (0, 2), (0, 3), (0, 4), (0, 5), (0, 6), (0, 7), (0, 8), (0, 9), (0, 12), (0, 13), (0, 15), (0, 16), (1, 2), (1, 3), (1, 7), (1, 8), (1, 9), (1, 13), (1, 14), (1, 15), (2, 3), (2, 4), (2, 7), (2, 10), (2, 11), (2, 14), (2, 16), (3, 8), (3, 11), (3, 13), (3, 15), (4, 5), (4, 9), (4, 10), (4, 14), (4, 16), (5, 8), (5, 9), (5, 10), (5, 12), (5, 15), (5, 16), (6, 8), (6, 13), (6, 14), (7, 8), (7, 9), (7, 10), (7, 12), (7, 13), (8, 9), (8, 10), (8, 11), (8, 12), (8, 13), (8, 16), (9, 10), (9, 11), (9, 13), (9, 14), (9, 16), (10, 12), (10, 14), (10, 15), (11, 12), (11, 13), (11, 14), (11, 15), (11, 16), (12, 13), (12, 16), (13, 15), (13, 16), (14, 15), what is its diameter, the length of the longest shortest path between any two nodes (None if the graph is not connected)? Return the answer in \boxed{} format. If the answer is a floating point number, round it to 2 decimal places. If the graph is not connected and the property is undefined, return 'None'. | {"task": "diameter", "samples": 40, "graph_type": "directed", "num_workers": 1} | "2" |
0diameter
| 0directed
| Given an undirected graph with edges (0, 3), (0, 4), (0, 5), (1, 2), (1, 3), (1, 4), (1, 8), (2, 3), (2, 4), (2, 5), (2, 7), (2, 9), (3, 5), (3, 8), (4, 9), (4, 10), (5, 6), (5, 7), (5, 9), (5, 10), (8, 10), what is its diameter, the length of the longest shortest path between any two nodes (None if the graph is not connected)? Return the answer in \boxed{} format. If the answer is a floating point number, round it to 2 decimal places. If the graph is not connected and the property is undefined, return 'None'. | {"task": "diameter", "samples": 40, "graph_type": "directed", "num_workers": 1} | "3" |
0diameter
| 0directed
| Given an undirected graph with edges (0, 3), (0, 11), (1, 6), (1, 8), (2, 5), (4, 7), (5, 6), (5, 8), (6, 8), (8, 11), what is its diameter, the length of the longest shortest path between any two nodes (None if the graph is not connected)? Return the answer in \boxed{} format. If the answer is a floating point number, round it to 2 decimal places. If the graph is not connected and the property is undefined, return 'None'. | {"task": "diameter", "samples": 40, "graph_type": "directed", "num_workers": 1} | "None" |
0diameter
| 0directed
| Given an undirected graph with edges (0, 1), (0, 2), (0, 3), (0, 4), (0, 6), (0, 7), (0, 8), (0, 9), (1, 4), (1, 6), (1, 7), (1, 8), (1, 9), (2, 3), (2, 8), (2, 9), (3, 4), (3, 5), (3, 6), (3, 7), (3, 8), (3, 9), (4, 5), (4, 7), (4, 8), (4, 9), (5, 8), (5, 9), (6, 8), (7, 9), what is its diameter, the length of the longest shortest path between any two nodes (None if the graph is not connected)? Return the answer in \boxed{} format. If the answer is a floating point number, round it to 2 decimal places. If the graph is not connected and the property is undefined, return 'None'. | {"task": "diameter", "samples": 40, "graph_type": "directed", "num_workers": 1} | "2" |
0diameter
| 0directed
| Given an undirected graph with edges (0, 2), (0, 12), (1, 3), (1, 5), (2, 7), (2, 12), (3, 4), (3, 7), (3, 9), (5, 11), (5, 13), (6, 7), (6, 8), (6, 12), (7, 8), (8, 9), (8, 12), (10, 11), (11, 13), what is its diameter, the length of the longest shortest path between any two nodes (None if the graph is not connected)? Return the answer in \boxed{} format. If the answer is a floating point number, round it to 2 decimal places. If the graph is not connected and the property is undefined, return 'None'. | {"task": "diameter", "samples": 40, "graph_type": "directed", "num_workers": 1} | "7" |
0diameter
| 0directed
| Given an undirected graph with edges (0, 1), (0, 4), (0, 6), (0, 10), (0, 12), (0, 13), (1, 5), (1, 8), (2, 8), (2, 9), (2, 12), (3, 7), (3, 10), (4, 12), (4, 14), (5, 8), (5, 9), (5, 10), (5, 13), (6, 9), (6, 14), (7, 10), (7, 14), (9, 11), (9, 14), (10, 11), (10, 12), (10, 14), (11, 14), (12, 14), (13, 14), what is its diameter, the length of the longest shortest path between any two nodes (None if the graph is not connected)? Return the answer in \boxed{} format. If the answer is a floating point number, round it to 2 decimal places. If the graph is not connected and the property is undefined, return 'None'. | {"task": "diameter", "samples": 40, "graph_type": "directed", "num_workers": 1} | "3" |
0diameter
| 0directed
| Given an undirected graph with edges (0, 8), (1, 3), (1, 6), (1, 11), (2, 5), (2, 6), (2, 7), (2, 11), (3, 5), (3, 10), (3, 12), (4, 8), (4, 12), (5, 10), (8, 10), (9, 10), what is its diameter, the length of the longest shortest path between any two nodes (None if the graph is not connected)? Return the answer in \boxed{} format. If the answer is a floating point number, round it to 2 decimal places. If the graph is not connected and the property is undefined, return 'None'. | {"task": "diameter", "samples": 40, "graph_type": "directed", "num_workers": 1} | "5" |
0diameter
| 0directed
| Given an undirected graph with edges (0, 1), (0, 3), (0, 8), (0, 9), (1, 3), (1, 11), (2, 6), (2, 10), (2, 11), (3, 11), (4, 9), (4, 11), (6, 8), (7, 9), (8, 11), what is its diameter, the length of the longest shortest path between any two nodes (None if the graph is not connected)? Return the answer in \boxed{} format. If the answer is a floating point number, round it to 2 decimal places. If the graph is not connected and the property is undefined, return 'None'. | {"task": "diameter", "samples": 40, "graph_type": "directed", "num_workers": 1} | "None" |
0diameter
| 0directed
| Given an undirected graph with edges (0, 4), (0, 8), (0, 13), (0, 14), (0, 18), (1, 2), (1, 3), (1, 6), (1, 12), (1, 13), (1, 18), (2, 14), (2, 16), (2, 17), (3, 4), (3, 8), (3, 11), (3, 17), (3, 18), (4, 9), (4, 12), (4, 14), (4, 15), (5, 8), (5, 9), (5, 10), (5, 11), (5, 16), (5, 17), (6, 7), (6, 11), (6, 12), (6, 17), (7, 8), (7, 13), (7, 15), (8, 12), (8, 13), (9, 11), (9, 12), (10, 12), (10, 14), (10, 15), (11, 12), (11, 17), (11, 18), (12, 15), (12, 16), (13, 16), (14, 15), (15, 17), what is its diameter, the length of the longest shortest path between any two nodes (None if the graph is not connected)? Return the answer in \boxed{} format. If the answer is a floating point number, round it to 2 decimal places. If the graph is not connected and the property is undefined, return 'None'. | {"task": "diameter", "samples": 40, "graph_type": "directed", "num_workers": 1} | "3" |
0diameter
| 0directed
| Given an undirected graph with edges (0, 5), (0, 12), (0, 13), (0, 19), (1, 2), (1, 5), (1, 7), (1, 12), (1, 16), (2, 4), (2, 7), (2, 8), (2, 12), (2, 14), (2, 18), (3, 6), (3, 8), (3, 10), (3, 13), (3, 14), (3, 15), (3, 17), (4, 14), (5, 6), (5, 10), (5, 11), (5, 16), (6, 7), (6, 9), (6, 10), (6, 12), (6, 15), (7, 11), (7, 14), (7, 15), (7, 18), (7, 19), (8, 19), (9, 10), (9, 17), (10, 16), (11, 12), (11, 18), (12, 18), (15, 16), (15, 17), (15, 19), (18, 19), what is its diameter, the length of the longest shortest path between any two nodes (None if the graph is not connected)? Return the answer in \boxed{} format. If the answer is a floating point number, round it to 2 decimal places. If the graph is not connected and the property is undefined, return 'None'. | {"task": "diameter", "samples": 40, "graph_type": "directed", "num_workers": 1} | "4" |
0diameter
| 0directed
| Given an undirected graph with edges (0, 1), (0, 2), (0, 3), (0, 5), (0, 8), (0, 10), (0, 12), (1, 3), (1, 5), (1, 6), (1, 7), (1, 10), (1, 13), (1, 16), (2, 3), (2, 4), (2, 5), (2, 6), (2, 8), (2, 12), (2, 14), (3, 4), (3, 6), (3, 12), (3, 13), (3, 15), (3, 16), (4, 5), (4, 6), (4, 7), (4, 8), (4, 10), (4, 14), (4, 15), (5, 7), (5, 10), (5, 11), (5, 12), (5, 13), (6, 7), (6, 8), (6, 13), (6, 14), (7, 8), (7, 11), (7, 12), (7, 15), (7, 16), (8, 9), (8, 11), (8, 13), (8, 14), (8, 16), (9, 11), (9, 12), (9, 13), (9, 14), (9, 15), (10, 12), (10, 13), (10, 16), (11, 12), (11, 16), (12, 13), (12, 14), (12, 15), (13, 14), (13, 15), (13, 16), (14, 16), (15, 16), what is its diameter, the length of the longest shortest path between any two nodes (None if the graph is not connected)? Return the answer in \boxed{} format. If the answer is a floating point number, round it to 2 decimal places. If the graph is not connected and the property is undefined, return 'None'. | {"task": "diameter", "samples": 40, "graph_type": "directed", "num_workers": 1} | "2" |
0diameter
| 0directed
| Given an undirected graph with edges (0, 1), (0, 3), (0, 5), (0, 7), (0, 8), (0, 9), (0, 12), (0, 13), (0, 14), (1, 2), (1, 7), (1, 8), (1, 9), (2, 5), (2, 10), (2, 11), (2, 12), (2, 14), (3, 4), (3, 5), (3, 7), (3, 10), (3, 11), (3, 12), (3, 14), (4, 5), (4, 8), (4, 9), (4, 10), (5, 7), (5, 9), (5, 10), (5, 13), (6, 7), (6, 9), (6, 13), (6, 14), (7, 8), (7, 13), (8, 9), (8, 10), (8, 13), (9, 11), (9, 12), (9, 14), (10, 13), (11, 12), (12, 14), what is its diameter, the length of the longest shortest path between any two nodes (None if the graph is not connected)? Return the answer in \boxed{} format. If the answer is a floating point number, round it to 2 decimal places. If the graph is not connected and the property is undefined, return 'None'. | {"task": "diameter", "samples": 40, "graph_type": "directed", "num_workers": 1} | "3" |
0diameter
| 0directed
| Given an undirected graph with edges (0, 1), (0, 4), (0, 7), (0, 9), (0, 10), (0, 12), (0, 13), (1, 4), (1, 9), (1, 13), (1, 15), (2, 7), (2, 8), (2, 9), (2, 10), (2, 11), (2, 12), (3, 6), (3, 11), (4, 11), (4, 14), (5, 9), (5, 10), (5, 11), (5, 14), (5, 15), (6, 9), (6, 10), (6, 11), (6, 13), (7, 9), (7, 14), (8, 10), (8, 14), (9, 12), (11, 13), (11, 14), (12, 14), (13, 15), what is its diameter, the length of the longest shortest path between any two nodes (None if the graph is not connected)? Return the answer in \boxed{} format. If the answer is a floating point number, round it to 2 decimal places. If the graph is not connected and the property is undefined, return 'None'. | {"task": "diameter", "samples": 40, "graph_type": "directed", "num_workers": 1} | "3" |
0diameter
| 0directed
| Given an undirected graph with edges (0, 5), (0, 6), (0, 8), (0, 10), (0, 12), (1, 2), (1, 9), (1, 10), (2, 9), (3, 7), (3, 11), (4, 5), (4, 6), (4, 8), (4, 9), (5, 7), (5, 8), (6, 10), (7, 8), (7, 10), (9, 11), (10, 12), (11, 12), what is its diameter, the length of the longest shortest path between any two nodes (None if the graph is not connected)? Return the answer in \boxed{} format. If the answer is a floating point number, round it to 2 decimal places. If the graph is not connected and the property is undefined, return 'None'. | {"task": "diameter", "samples": 40, "graph_type": "directed", "num_workers": 1} | "3" |
0diameter
| 0directed
| Given an undirected graph with edges (0, 13), (0, 14), (0, 15), (1, 4), (1, 12), (2, 5), (2, 6), (2, 7), (2, 8), (2, 11), (2, 13), (2, 15), (3, 9), (3, 13), (3, 14), (4, 8), (4, 11), (4, 16), (5, 8), (5, 14), (6, 16), (7, 8), (7, 13), (7, 14), (8, 9), (8, 11), (8, 13), (9, 12), (9, 14), (9, 15), (10, 11), (10, 16), (11, 12), (12, 13), (12, 14), (12, 15), (13, 16), (14, 16), what is its diameter, the length of the longest shortest path between any two nodes (None if the graph is not connected)? Return the answer in \boxed{} format. If the answer is a floating point number, round it to 2 decimal places. If the graph is not connected and the property is undefined, return 'None'. | {"task": "diameter", "samples": 40, "graph_type": "directed", "num_workers": 1} | "3" |
0diameter
| 0directed
| Given an undirected graph with edges (1, 2), (2, 9), (3, 5), (3, 7), (3, 9), (4, 5), (4, 6), (4, 9), (4, 10), (5, 6), (5, 10), (9, 10), what is its diameter, the length of the longest shortest path between any two nodes (None if the graph is not connected)? Return the answer in \boxed{} format. If the answer is a floating point number, round it to 2 decimal places. If the graph is not connected and the property is undefined, return 'None'. | {"task": "diameter", "samples": 40, "graph_type": "directed", "num_workers": 1} | "None" |
0diameter
| 0directed
| Given an undirected graph with edges (0, 1), (0, 2), (0, 3), (0, 5), (0, 6), (0, 8), (0, 12), (1, 2), (2, 7), (3, 5), (3, 9), (4, 11), (4, 12), (5, 6), (5, 7), (5, 10), (6, 8), (6, 10), (6, 11), (6, 12), (7, 8), (7, 9), (7, 10), (8, 10), (9, 10), (9, 11), (9, 12), (10, 12), what is its diameter, the length of the longest shortest path between any two nodes (None if the graph is not connected)? Return the answer in \boxed{} format. If the answer is a floating point number, round it to 2 decimal places. If the graph is not connected and the property is undefined, return 'None'. | {"task": "diameter", "samples": 40, "graph_type": "directed", "num_workers": 1} | "3" |
0diameter
| 0directed
| Given an undirected graph with edges (0, 1), (0, 3), (0, 4), (0, 9), (0, 15), (0, 16), (0, 18), (1, 2), (1, 5), (1, 6), (1, 10), (1, 11), (1, 14), (1, 16), (1, 18), (2, 3), (2, 5), (2, 6), (2, 8), (2, 10), (2, 12), (2, 14), (3, 5), (3, 9), (3, 14), (3, 15), (3, 16), (4, 6), (4, 10), (4, 11), (4, 14), (4, 18), (5, 6), (5, 8), (5, 9), (5, 11), (5, 12), (5, 13), (5, 16), (6, 8), (6, 11), (6, 13), (6, 14), (6, 15), (6, 18), (7, 10), (7, 14), (7, 16), (7, 17), (7, 18), (8, 10), (8, 14), (8, 15), (8, 18), (9, 10), (9, 11), (9, 12), (9, 14), (9, 15), (9, 17), (9, 18), (10, 13), (10, 14), (10, 16), (11, 14), (11, 16), (11, 17), (12, 14), (12, 15), (12, 16), (12, 18), (13, 16), (14, 18), (16, 17), what is its diameter, the length of the longest shortest path between any two nodes (None if the graph is not connected)? Return the answer in \boxed{} format. If the answer is a floating point number, round it to 2 decimal places. If the graph is not connected and the property is undefined, return 'None'. | {"task": "diameter", "samples": 40, "graph_type": "directed", "num_workers": 1} | "3" |
0diameter
| 0directed
| Given an undirected graph with edges (0, 1), (0, 2), (0, 4), (0, 5), (0, 8), (0, 10), (0, 11), (1, 4), (1, 6), (1, 8), (1, 10), (1, 12), (2, 3), (2, 6), (2, 7), (2, 10), (2, 11), (3, 8), (3, 9), (3, 11), (3, 12), (3, 13), (4, 6), (4, 7), (4, 10), (4, 12), (4, 13), (5, 7), (5, 8), (5, 11), (6, 9), (6, 11), (6, 13), (7, 9), (7, 11), (7, 13), (8, 9), (8, 13), (10, 13), (12, 13), what is its diameter, the length of the longest shortest path between any two nodes (None if the graph is not connected)? Return the answer in \boxed{} format. If the answer is a floating point number, round it to 2 decimal places. If the graph is not connected and the property is undefined, return 'None'. | {"task": "diameter", "samples": 40, "graph_type": "directed", "num_workers": 1} | "3" |
0diameter
| 0directed
| Given an undirected graph with edges (0, 1), (0, 3), (0, 5), (0, 6), (0, 7), (0, 11), (1, 2), (1, 4), (1, 5), (1, 7), (1, 11), (2, 3), (2, 4), (2, 6), (2, 8), (2, 10), (3, 4), (3, 6), (3, 9), (3, 11), (4, 6), (4, 10), (4, 11), (5, 6), (5, 10), (6, 8), (6, 11), (7, 8), (7, 9), (7, 11), (9, 11), what is its diameter, the length of the longest shortest path between any two nodes (None if the graph is not connected)? Return the answer in \boxed{} format. If the answer is a floating point number, round it to 2 decimal places. If the graph is not connected and the property is undefined, return 'None'. | {"task": "diameter", "samples": 40, "graph_type": "directed", "num_workers": 1} | "3" |
0diameter
| 0directed
| Given an undirected graph with edges (0, 5), (0, 6), (0, 15), (1, 8), (1, 10), (2, 14), (2, 15), (3, 4), (5, 10), (5, 12), (5, 14), (5, 15), (6, 7), (7, 13), (8, 9), (8, 11), (8, 14), (8, 15), (9, 13), (10, 12), (10, 13), (10, 14), what is its diameter, the length of the longest shortest path between any two nodes (None if the graph is not connected)? Return the answer in \boxed{} format. If the answer is a floating point number, round it to 2 decimal places. If the graph is not connected and the property is undefined, return 'None'. | {"task": "diameter", "samples": 40, "graph_type": "directed", "num_workers": 1} | "None" |
0diameter
| 0directed
| Given an undirected graph with edges (0, 3), (0, 9), (0, 12), (0, 15), (1, 3), (1, 11), (1, 14), (1, 18), (2, 3), (2, 5), (2, 13), (2, 14), (3, 9), (3, 10), (3, 13), (3, 17), (3, 18), (4, 5), (4, 7), (4, 9), (4, 13), (4, 18), (5, 14), (6, 7), (6, 8), (6, 16), (6, 18), (7, 8), (7, 10), (7, 12), (8, 10), (8, 13), (8, 18), (9, 11), (9, 13), (9, 14), (9, 18), (10, 13), (10, 16), (10, 18), (11, 14), (13, 17), (13, 18), (14, 17), (16, 17), (16, 18), what is its diameter, the length of the longest shortest path between any two nodes (None if the graph is not connected)? Return the answer in \boxed{} format. If the answer is a floating point number, round it to 2 decimal places. If the graph is not connected and the property is undefined, return 'None'. | {"task": "diameter", "samples": 40, "graph_type": "directed", "num_workers": 1} | "4" |
0diameter
| 0directed
| Given an undirected graph with edges (0, 2), (0, 7), (0, 8), (1, 5), (1, 6), (2, 3), (2, 8), (2, 13), (3, 4), (3, 6), (3, 12), (4, 7), (5, 11), (6, 9), (6, 13), (7, 8), (7, 12), (7, 13), (8, 11), (10, 11), what is its diameter, the length of the longest shortest path between any two nodes (None if the graph is not connected)? Return the answer in \boxed{} format. If the answer is a floating point number, round it to 2 decimal places. If the graph is not connected and the property is undefined, return 'None'. | {"task": "diameter", "samples": 40, "graph_type": "directed", "num_workers": 1} | "None" |
0diameter
| 0directed
| Given an undirected graph with edges (0, 6), (1, 3), (1, 4), (1, 8), (2, 3), (2, 4), (2, 9), (3, 7), (3, 8), (3, 9), (4, 7), (4, 8), (5, 6), (5, 8), (6, 9), (8, 9), what is its diameter, the length of the longest shortest path between any two nodes (None if the graph is not connected)? Return the answer in \boxed{} format. If the answer is a floating point number, round it to 2 decimal places. If the graph is not connected and the property is undefined, return 'None'. | {"task": "diameter", "samples": 40, "graph_type": "directed", "num_workers": 1} | "4" |
0diameter
| 0directed
| Given an undirected graph with edges (1, 6), (1, 13), (1, 14), (2, 11), (2, 12), (2, 14), (3, 7), (3, 16), (4, 8), (4, 10), (5, 9), (5, 11), (5, 13), (5, 14), (6, 9), (6, 12), (6, 13), (9, 13), (10, 13), (10, 15), (11, 12), (11, 15), (14, 15), (14, 16), what is its diameter, the length of the longest shortest path between any two nodes (None if the graph is not connected)? Return the answer in \boxed{} format. If the answer is a floating point number, round it to 2 decimal places. If the graph is not connected and the property is undefined, return 'None'. | {"task": "diameter", "samples": 40, "graph_type": "directed", "num_workers": 1} | "None" |
0diameter
| 0directed
| Given an undirected graph with edges (0, 2), (0, 4), (0, 8), (0, 10), (1, 5), (1, 8), (2, 3), (2, 4), (2, 7), (3, 6), (3, 9), (4, 5), (4, 7), (6, 7), (6, 8), (7, 8), (7, 10), what is its diameter, the length of the longest shortest path between any two nodes (None if the graph is not connected)? Return the answer in \boxed{} format. If the answer is a floating point number, round it to 2 decimal places. If the graph is not connected and the property is undefined, return 'None'. | {"task": "diameter", "samples": 40, "graph_type": "directed", "num_workers": 1} | "4" |
0diameter
| 0directed
| Given an undirected graph with edges (0, 1), (0, 4), (0, 10), (1, 2), (1, 4), (2, 10), (2, 11), (2, 13), (3, 8), (3, 14), (4, 5), (4, 9), (4, 13), (5, 6), (6, 11), (6, 13), (7, 12), (7, 13), (8, 12), (9, 14), (9, 15), (10, 15), (11, 15), (12, 14), (13, 15), what is its diameter, the length of the longest shortest path between any two nodes (None if the graph is not connected)? Return the answer in \boxed{} format. If the answer is a floating point number, round it to 2 decimal places. If the graph is not connected and the property is undefined, return 'None'. | {"task": "diameter", "samples": 40, "graph_type": "directed", "num_workers": 1} | "5" |
0diameter
| 0directed
| Given an undirected graph with edges (0, 2), (0, 3), (0, 5), (0, 12), (0, 13), (1, 5), (1, 6), (1, 13), (2, 8), (2, 12), (2, 13), (3, 12), (3, 13), (4, 5), (4, 6), (5, 6), (5, 8), (5, 9), (5, 10), (5, 13), (7, 8), (7, 9), (7, 10), (7, 11), (7, 13), (8, 9), (8, 12), (10, 13), (11, 13), what is its diameter, the length of the longest shortest path between any two nodes (None if the graph is not connected)? Return the answer in \boxed{} format. If the answer is a floating point number, round it to 2 decimal places. If the graph is not connected and the property is undefined, return 'None'. | {"task": "diameter", "samples": 40, "graph_type": "directed", "num_workers": 1} | "3" |
0diameter
| 0directed
| Given an undirected graph with edges (0, 6), (1, 7), (2, 4), (2, 5), (3, 5), (5, 7), (5, 10), (7, 10), (8, 9), what is its diameter, the length of the longest shortest path between any two nodes (None if the graph is not connected)? Return the answer in \boxed{} format. If the answer is a floating point number, round it to 2 decimal places. If the graph is not connected and the property is undefined, return 'None'. | {"task": "diameter", "samples": 40, "graph_type": "directed", "num_workers": 1} | "None" |
0diameter
| 0directed
| Given an undirected graph with edges (0, 10), (0, 11), (0, 12), (1, 4), (1, 5), (1, 9), (1, 10), (1, 13), (1, 14), (2, 3), (2, 9), (2, 10), (2, 11), (2, 13), (2, 15), (2, 16), (3, 9), (4, 5), (4, 12), (4, 13), (5, 7), (5, 9), (5, 10), (6, 10), (6, 14), (7, 14), (8, 12), (8, 14), (8, 16), (9, 10), (9, 11), (9, 12), (9, 15), (10, 11), (10, 14), (10, 15), (11, 12), (11, 15), (11, 16), (12, 15), (12, 16), (13, 15), (14, 15), (15, 16), what is its diameter, the length of the longest shortest path between any two nodes (None if the graph is not connected)? Return the answer in \boxed{} format. If the answer is a floating point number, round it to 2 decimal places. If the graph is not connected and the property is undefined, return 'None'. | {"task": "diameter", "samples": 40, "graph_type": "directed", "num_workers": 1} | "3" |
0diameter
| 0directed
| Given an undirected graph with edges (0, 8), (0, 9), (1, 3), (2, 4), (2, 5), (2, 9), (3, 5), (3, 7), (3, 8), (4, 5), (4, 8), (5, 7), (5, 8), (6, 9), (7, 9), (8, 9), what is its diameter, the length of the longest shortest path between any two nodes (None if the graph is not connected)? Return the answer in \boxed{} format. If the answer is a floating point number, round it to 2 decimal places. If the graph is not connected and the property is undefined, return 'None'. | {"task": "diameter", "samples": 40, "graph_type": "directed", "num_workers": 1} | "4" |
0diameter
| 0directed
| Given an undirected graph with edges (0, 5), (0, 7), (1, 8), (2, 7), (3, 4), (4, 6), (4, 11), (4, 14), (6, 17), (7, 11), (7, 16), (10, 14), (13, 14), (13, 18), (14, 15), what is its diameter, the length of the longest shortest path between any two nodes (None if the graph is not connected)? Return the answer in \boxed{} format. If the answer is a floating point number, round it to 2 decimal places. If the graph is not connected and the property is undefined, return 'None'. | {"task": "diameter", "samples": 40, "graph_type": "directed", "num_workers": 1} | "None" |
0diameter
| 0directed
| Given an undirected graph with edges (0, 6), (0, 7), (1, 2), (1, 6), (1, 7), (1, 9), (2, 3), (2, 7), (3, 4), (3, 9), (4, 5), (4, 7), (5, 6), (7, 9), what is its diameter, the length of the longest shortest path between any two nodes (None if the graph is not connected)? Return the answer in \boxed{} format. If the answer is a floating point number, round it to 2 decimal places. If the graph is not connected and the property is undefined, return 'None'. | {"task": "diameter", "samples": 40, "graph_type": "directed", "num_workers": 1} | "None" |
0diameter
| 0directed
| Given an undirected graph with edges (0, 1), (0, 3), (0, 6), (0, 10), (0, 11), (0, 12), (1, 2), (1, 3), (1, 6), (1, 12), (1, 15), (1, 16), (1, 17), (1, 18), (1, 19), (2, 5), (2, 6), (2, 7), (2, 8), (2, 10), (2, 11), (2, 12), (2, 15), (2, 16), (2, 17), (2, 19), (3, 6), (3, 8), (3, 10), (3, 11), (3, 17), (3, 18), (4, 6), (4, 7), (4, 8), (4, 9), (4, 14), (4, 15), (4, 16), (5, 6), (5, 10), (5, 13), (5, 17), (5, 18), (5, 19), (6, 8), (6, 9), (6, 11), (6, 13), (6, 14), (6, 15), (6, 16), (6, 17), (7, 9), (7, 10), (7, 11), (7, 12), (7, 14), (7, 15), (7, 16), (7, 19), (8, 12), (8, 15), (8, 17), (9, 10), (9, 13), (9, 15), (9, 17), (10, 15), (10, 17), (10, 19), (11, 13), (11, 16), (11, 18), (11, 19), (12, 15), (12, 16), (12, 17), (12, 18), (12, 19), (13, 14), (13, 16), (13, 19), (14, 19), (15, 19), (16, 18), what is its diameter, the length of the longest shortest path between any two nodes (None if the graph is not connected)? Return the answer in \boxed{} format. If the answer is a floating point number, round it to 2 decimal places. If the graph is not connected and the property is undefined, return 'None'. | {"task": "diameter", "samples": 40, "graph_type": "directed", "num_workers": 1} | "3" |
0diameter
| 0directed
| Given an undirected graph with edges (0, 1), (0, 6), (0, 7), (0, 8), (0, 10), (1, 3), (1, 7), (2, 4), (2, 6), (2, 7), (2, 8), (2, 9), (3, 6), (3, 7), (3, 8), (4, 5), (4, 6), (5, 6), (5, 7), (5, 10), (6, 8), (6, 9), (6, 10), (7, 9), (7, 10), (8, 9), (8, 10), what is its diameter, the length of the longest shortest path between any two nodes (None if the graph is not connected)? Return the answer in \boxed{} format. If the answer is a floating point number, round it to 2 decimal places. If the graph is not connected and the property is undefined, return 'None'. | {"task": "diameter", "samples": 40, "graph_type": "directed", "num_workers": 1} | "3" |
0diameter
| 0directed
| Given an undirected graph with edges (0, 2), (0, 5), (0, 7), (1, 2), (1, 3), (1, 8), (1, 9), (3, 8), (4, 7), (4, 8), what is its diameter, the length of the longest shortest path between any two nodes (None if the graph is not connected)? Return the answer in \boxed{} format. If the answer is a floating point number, round it to 2 decimal places. If the graph is not connected and the property is undefined, return 'None'. | {"task": "diameter", "samples": 40, "graph_type": "directed", "num_workers": 1} | "None" |
0diameter
| 0directed
| Given an undirected graph with edges (0, 2), (0, 4), (0, 6), (1, 2), (1, 5), (1, 6), (1, 7), (2, 5), (2, 6), (2, 8), (3, 6), (3, 7), (3, 8), (4, 7), (4, 8), (5, 7), (7, 8), (7, 9), (8, 9), what is its diameter, the length of the longest shortest path between any two nodes (None if the graph is not connected)? Return the answer in \boxed{} format. If the answer is a floating point number, round it to 2 decimal places. If the graph is not connected and the property is undefined, return 'None'. | {"task": "diameter", "samples": 40, "graph_type": "directed", "num_workers": 1} | "3" |
0diameter
| 0directed
| Given an undirected graph with edges (0, 2), (0, 4), (0, 6), (0, 11), (0, 13), (1, 2), (1, 6), (1, 8), (2, 3), (2, 5), (2, 10), (2, 11), (2, 13), (3, 4), (3, 9), (3, 13), (4, 6), (4, 8), (4, 9), (4, 11), (4, 12), (4, 13), (5, 6), (5, 9), (5, 11), (5, 12), (5, 13), (6, 9), (6, 10), (6, 12), (7, 9), (7, 12), (7, 13), (8, 10), (8, 11), (9, 11), (9, 12), (9, 13), (10, 11), (10, 12), (11, 12), (11, 13), what is its diameter, the length of the longest shortest path between any two nodes (None if the graph is not connected)? Return the answer in \boxed{} format. If the answer is a floating point number, round it to 2 decimal places. If the graph is not connected and the property is undefined, return 'None'. | {"task": "diameter", "samples": 40, "graph_type": "directed", "num_workers": 1} | "3" |
0diameter
| 1undirected
| Given an undirected graph with edges (0, 1), (0, 3), (0, 4), (0, 6), (1, 10), (2, 4), (2, 5), (2, 10), (3, 6), (3, 10), (4, 6), (4, 8), (4, 11), (4, 12), (5, 7), (5, 10), (5, 11), (5, 12), (6, 7), (6, 10), (6, 11), (6, 12), (7, 10), (7, 11), (8, 12), what is its diameter, the length of the longest shortest path between any two nodes (None if the graph is not connected)? Return the answer in \boxed{} format. If the answer is a floating point number, round it to 2 decimal places. If the graph is not connected and the property is undefined, return 'None'. | {"task": "diameter", "samples": 40, "graph_type": "undirected", "num_workers": 1} | "None" |
0diameter
| 1undirected
| Given an undirected graph with edges (0, 4), (0, 13), (0, 14), (1, 3), (1, 5), (1, 11), (1, 14), (2, 8), (2, 16), (3, 8), (4, 5), (4, 7), (4, 10), (4, 12), (4, 16), (5, 18), (6, 9), (6, 14), (6, 16), (6, 18), (7, 9), (7, 13), (7, 17), (8, 12), (8, 17), (8, 18), (9, 14), (10, 11), (10, 15), (11, 12), (12, 17), (13, 17), (13, 18), (14, 16), (14, 18), (15, 18), (16, 18), (17, 18), what is its diameter, the length of the longest shortest path between any two nodes (None if the graph is not connected)? Return the answer in \boxed{} format. If the answer is a floating point number, round it to 2 decimal places. If the graph is not connected and the property is undefined, return 'None'. | {"task": "diameter", "samples": 40, "graph_type": "undirected", "num_workers": 1} | "3" |
0diameter
| 1undirected
| Given an undirected graph with edges (0, 1), (0, 9), (2, 10), (3, 4), (3, 7), (3, 9), (3, 10), (4, 10), (4, 16), (5, 9), (5, 11), (5, 17), (6, 8), (6, 11), (6, 17), (7, 12), (9, 14), (9, 15), (10, 12), (10, 14), (10, 17), (11, 13), (11, 15), (11, 17), (12, 16), (14, 16), (15, 16), (16, 17), what is its diameter, the length of the longest shortest path between any two nodes (None if the graph is not connected)? Return the answer in \boxed{} format. If the answer is a floating point number, round it to 2 decimal places. If the graph is not connected and the property is undefined, return 'None'. | {"task": "diameter", "samples": 40, "graph_type": "undirected", "num_workers": 1} | "6" |
0diameter
| 1undirected
| Given an undirected graph with edges (0, 2), (0, 3), (0, 4), (0, 6), (0, 10), (1, 3), (1, 4), (1, 5), (1, 7), (1, 8), (1, 9), (2, 4), (2, 8), (2, 9), (2, 11), (3, 4), (3, 6), (3, 10), (4, 5), (4, 8), (4, 9), (4, 10), (5, 7), (5, 8), (5, 10), (5, 11), (6, 8), (6, 11), (7, 8), (7, 9), (8, 11), (9, 11), what is its diameter, the length of the longest shortest path between any two nodes (None if the graph is not connected)? Return the answer in \boxed{} format. If the answer is a floating point number, round it to 2 decimal places. If the graph is not connected and the property is undefined, return 'None'. | {"task": "diameter", "samples": 40, "graph_type": "undirected", "num_workers": 1} | "3" |
0diameter
| 1undirected
| Given an undirected graph with edges (0, 1), (0, 10), (0, 12), (1, 4), (1, 7), (1, 9), (2, 3), (2, 5), (2, 6), (2, 9), (2, 11), (2, 15), (2, 17), (3, 10), (3, 15), (3, 16), (4, 7), (4, 9), (4, 11), (5, 7), (5, 8), (5, 9), (5, 16), (6, 8), (6, 12), (6, 14), (7, 11), (7, 16), (8, 9), (9, 14), (9, 15), (10, 13), (10, 16), (10, 17), (11, 13), (12, 13), (12, 17), (13, 14), (14, 15), (16, 17), what is its diameter, the length of the longest shortest path between any two nodes (None if the graph is not connected)? Return the answer in \boxed{} format. If the answer is a floating point number, round it to 2 decimal places. If the graph is not connected and the property is undefined, return 'None'. | {"task": "diameter", "samples": 40, "graph_type": "undirected", "num_workers": 1} | "3" |
0diameter
| 1undirected
| Given an undirected graph with edges (0, 1), (0, 2), (0, 3), (0, 6), (0, 9), (0, 11), (0, 13), (0, 15), (0, 16), (1, 3), (1, 4), (1, 6), (1, 12), (1, 15), (2, 3), (2, 4), (2, 5), (2, 6), (2, 8), (2, 10), (2, 11), (2, 14), (2, 16), (3, 5), (3, 7), (3, 8), (3, 10), (3, 13), (3, 16), (4, 5), (4, 7), (4, 8), (4, 14), (4, 15), (4, 16), (5, 7), (5, 8), (5, 10), (5, 16), (6, 7), (6, 10), (6, 13), (6, 15), (7, 8), (7, 10), (8, 9), (8, 11), (8, 12), (8, 16), (9, 10), (9, 11), (10, 14), (11, 12), (14, 15), (14, 16), (15, 16), what is its diameter, the length of the longest shortest path between any two nodes (None if the graph is not connected)? Return the answer in \boxed{} format. If the answer is a floating point number, round it to 2 decimal places. If the graph is not connected and the property is undefined, return 'None'. | {"task": "diameter", "samples": 40, "graph_type": "undirected", "num_workers": 1} | "3" |
0diameter
| 1undirected
| Given an undirected graph with edges (0, 4), (0, 9), (0, 11), (1, 2), (1, 5), (1, 6), (1, 7), (1, 11), (2, 3), (2, 4), (2, 6), (2, 9), (2, 10), (3, 4), (3, 5), (3, 7), (3, 8), (3, 9), (4, 5), (4, 6), (4, 10), (4, 11), (5, 8), (5, 10), (6, 11), (7, 9), (8, 9), (8, 10), (8, 11), (9, 11), what is its diameter, the length of the longest shortest path between any two nodes (None if the graph is not connected)? Return the answer in \boxed{} format. If the answer is a floating point number, round it to 2 decimal places. If the graph is not connected and the property is undefined, return 'None'. | {"task": "diameter", "samples": 40, "graph_type": "undirected", "num_workers": 1} | "3" |
0diameter
| 1undirected
| Given an undirected graph with edges (0, 1), (0, 5), (0, 7), (0, 8), (0, 10), (0, 11), (1, 2), (1, 6), (1, 8), (1, 9), (1, 10), (1, 11), (2, 9), (3, 4), (3, 9), (3, 10), (5, 6), (5, 9), (5, 10), (6, 7), (6, 8), (6, 11), (7, 11), (8, 9), (8, 10), (9, 11), what is its diameter, the length of the longest shortest path between any two nodes (None if the graph is not connected)? Return the answer in \boxed{} format. If the answer is a floating point number, round it to 2 decimal places. If the graph is not connected and the property is undefined, return 'None'. | {"task": "diameter", "samples": 40, "graph_type": "undirected", "num_workers": 1} | "4" |
0diameter
| 1undirected
| Given an undirected graph with edges (0, 4), (0, 6), (0, 8), (1, 8), (2, 6), (2, 8), (3, 5), (3, 8), (3, 9), (4, 7), (5, 8), (5, 9), (6, 9), (7, 8), (8, 9), what is its diameter, the length of the longest shortest path between any two nodes (None if the graph is not connected)? Return the answer in \boxed{} format. If the answer is a floating point number, round it to 2 decimal places. If the graph is not connected and the property is undefined, return 'None'. | {"task": "diameter", "samples": 40, "graph_type": "undirected", "num_workers": 1} | "3" |
0diameter
| 1undirected
| Given an undirected graph with edges (1, 6), (1, 8), (1, 10), (2, 4), (3, 6), (4, 6), (4, 9), (4, 10), (5, 6), (5, 9), (6, 8), (6, 10), (8, 9), what is its diameter, the length of the longest shortest path between any two nodes (None if the graph is not connected)? Return the answer in \boxed{} format. If the answer is a floating point number, round it to 2 decimal places. If the graph is not connected and the property is undefined, return 'None'. | {"task": "diameter", "samples": 40, "graph_type": "undirected", "num_workers": 1} | "None" |
0diameter
| 1undirected
| Given an undirected graph with edges (0, 1), (0, 2), (0, 3), (0, 13), (0, 14), (0, 18), (1, 2), (1, 4), (1, 5), (1, 9), (1, 11), (1, 14), (1, 17), (2, 3), (2, 6), (2, 7), (2, 10), (2, 15), (2, 19), (3, 4), (3, 7), (3, 9), (3, 12), (3, 14), (3, 15), (4, 6), (4, 11), (4, 15), (4, 17), (5, 11), (5, 15), (6, 8), (6, 11), (6, 13), (6, 15), (6, 18), (6, 19), (7, 8), (7, 10), (7, 12), (7, 15), (7, 18), (8, 9), (8, 12), (8, 17), (9, 11), (9, 12), (9, 14), (9, 15), (9, 17), (10, 17), (10, 18), (11, 13), (11, 18), (12, 15), (12, 16), (13, 16), (13, 18), (14, 17), (14, 19), (18, 19), what is its diameter, the length of the longest shortest path between any two nodes (None if the graph is not connected)? Return the answer in \boxed{} format. If the answer is a floating point number, round it to 2 decimal places. If the graph is not connected and the property is undefined, return 'None'. | {"task": "diameter", "samples": 40, "graph_type": "undirected", "num_workers": 1} | "3" |
0diameter
| 1undirected
| Given an undirected graph with edges (0, 12), (0, 13), (1, 9), (1, 11), (1, 13), (2, 6), (2, 7), (2, 9), (3, 5), (3, 7), (3, 8), (3, 12), (4, 8), (5, 9), (5, 10), (5, 12), (6, 8), (6, 9), (6, 12), (7, 12), (7, 13), (8, 12), (9, 11), what is its diameter, the length of the longest shortest path between any two nodes (None if the graph is not connected)? Return the answer in \boxed{} format. If the answer is a floating point number, round it to 2 decimal places. If the graph is not connected and the property is undefined, return 'None'. | {"task": "diameter", "samples": 40, "graph_type": "undirected", "num_workers": 1} | "4" |
0diameter
| 1undirected
| Given an undirected graph with edges (0, 4), (0, 5), (0, 9), (1, 2), (1, 11), (2, 8), (2, 11), (3, 7), (3, 10), (4, 7), (5, 6), (5, 11), (6, 10), (7, 11), (8, 9), (8, 10), (8, 11), what is its diameter, the length of the longest shortest path between any two nodes (None if the graph is not connected)? Return the answer in \boxed{} format. If the answer is a floating point number, round it to 2 decimal places. If the graph is not connected and the property is undefined, return 'None'. | {"task": "diameter", "samples": 40, "graph_type": "undirected", "num_workers": 1} | "3" |
0diameter
| 1undirected
| Given an undirected graph with edges (0, 3), (0, 4), (3, 4), (3, 6), (3, 8), (3, 10), (4, 10), (7, 10), (9, 10), what is its diameter, the length of the longest shortest path between any two nodes (None if the graph is not connected)? Return the answer in \boxed{} format. If the answer is a floating point number, round it to 2 decimal places. If the graph is not connected and the property is undefined, return 'None'. | {"task": "diameter", "samples": 40, "graph_type": "undirected", "num_workers": 1} | "None" |
0diameter
| 1undirected
| Given an undirected graph with edges (0, 2), (0, 4), (0, 8), (1, 2), (1, 8), (1, 9), (2, 4), (2, 5), (2, 8), (2, 10), (3, 5), (3, 7), (3, 10), (4, 6), (4, 8), (4, 10), (5, 6), (5, 10), (6, 7), (6, 9), (6, 10), (7, 10), (8, 9), (8, 10), what is its diameter, the length of the longest shortest path between any two nodes (None if the graph is not connected)? Return the answer in \boxed{} format. If the answer is a floating point number, round it to 2 decimal places. If the graph is not connected and the property is undefined, return 'None'. | {"task": "diameter", "samples": 40, "graph_type": "undirected", "num_workers": 1} | "3" |
0diameter
| 1undirected
| Given an undirected graph with edges (0, 1), (0, 9), (0, 14), (0, 15), (0, 16), (0, 17), (1, 2), (1, 7), (1, 10), (1, 17), (2, 4), (2, 5), (3, 16), (4, 8), (5, 11), (5, 16), (5, 18), (6, 18), (7, 11), (7, 14), (7, 18), (8, 11), (8, 15), (8, 17), (9, 10), (9, 12), (9, 18), (10, 14), (10, 15), (11, 16), (12, 13), (12, 18), what is its diameter, the length of the longest shortest path between any two nodes (None if the graph is not connected)? Return the answer in \boxed{} format. If the answer is a floating point number, round it to 2 decimal places. If the graph is not connected and the property is undefined, return 'None'. | {"task": "diameter", "samples": 40, "graph_type": "undirected", "num_workers": 1} | "5" |
0diameter
| 1undirected
| Given an undirected graph with edges (0, 1), (0, 3), (1, 6), (1, 9), (1, 10), (2, 3), (2, 4), (2, 7), (2, 8), (3, 10), (3, 13), (4, 5), (4, 7), (4, 10), (4, 11), (6, 14), (7, 9), (7, 13), (7, 14), (9, 13), (9, 14), (10, 14), what is its diameter, the length of the longest shortest path between any two nodes (None if the graph is not connected)? Return the answer in \boxed{} format. If the answer is a floating point number, round it to 2 decimal places. If the graph is not connected and the property is undefined, return 'None'. | {"task": "diameter", "samples": 40, "graph_type": "undirected", "num_workers": 1} | "None" |
0diameter
| 1undirected
| Given an undirected graph with edges (1, 4), (1, 5), (1, 6), (1, 7), (1, 9), (2, 5), (2, 6), (2, 8), (3, 4), (3, 5), (3, 7), (3, 9), (4, 6), (4, 7), (4, 8), (8, 9), what is its diameter, the length of the longest shortest path between any two nodes (None if the graph is not connected)? Return the answer in \boxed{} format. If the answer is a floating point number, round it to 2 decimal places. If the graph is not connected and the property is undefined, return 'None'. | {"task": "diameter", "samples": 40, "graph_type": "undirected", "num_workers": 1} | "None" |
0diameter
| 1undirected
| Given an undirected graph with edges (0, 1), (0, 2), (0, 4), (0, 6), (1, 2), (1, 6), (1, 10), (1, 11), (2, 9), (2, 10), (3, 9), (3, 11), (4, 6), (4, 8), (4, 11), (5, 9), (6, 7), (6, 10), (7, 8), (7, 9), (7, 11), (8, 9), (8, 10), (8, 11), (9, 10), what is its diameter, the length of the longest shortest path between any two nodes (None if the graph is not connected)? Return the answer in \boxed{} format. If the answer is a floating point number, round it to 2 decimal places. If the graph is not connected and the property is undefined, return 'None'. | {"task": "diameter", "samples": 40, "graph_type": "undirected", "num_workers": 1} | "3" |
0diameter
| 1undirected
| Given an undirected graph with edges (0, 4), (0, 10), (0, 12), (1, 7), (1, 9), (1, 10), (1, 11), (1, 12), (2, 3), (2, 4), (2, 5), (2, 10), (3, 4), (3, 5), (3, 6), (3, 7), (3, 10), (3, 11), (3, 12), (3, 13), (4, 7), (4, 11), (4, 12), (5, 7), (5, 8), (5, 11), (6, 10), (6, 11), (7, 8), (7, 12), (8, 10), (9, 13), (10, 11), (10, 12), (10, 13), what is its diameter, the length of the longest shortest path between any two nodes (None if the graph is not connected)? Return the answer in \boxed{} format. If the answer is a floating point number, round it to 2 decimal places. If the graph is not connected and the property is undefined, return 'None'. | {"task": "diameter", "samples": 40, "graph_type": "undirected", "num_workers": 1} | "3" |
0diameter
| 1undirected
| Given an undirected graph with edges (0, 1), (0, 2), (0, 4), (0, 5), (0, 6), (0, 9), (1, 2), (1, 3), (1, 7), (1, 10), (2, 4), (2, 5), (2, 9), (2, 10), (3, 4), (3, 5), (3, 8), (3, 9), (4, 5), (4, 6), (4, 7), (4, 8), (5, 6), (5, 7), (5, 10), (6, 9), (6, 10), (7, 8), (7, 9), (7, 10), (8, 9), (8, 10), (9, 10), what is its diameter, the length of the longest shortest path between any two nodes (None if the graph is not connected)? Return the answer in \boxed{} format. If the answer is a floating point number, round it to 2 decimal places. If the graph is not connected and the property is undefined, return 'None'. | {"task": "diameter", "samples": 40, "graph_type": "undirected", "num_workers": 1} | "2" |
0diameter
| 1undirected
| Given an undirected graph with edges (0, 7), (0, 8), (1, 12), (2, 6), (5, 7), (5, 14), (5, 15), (6, 11), (6, 14), (7, 10), (8, 12), (8, 13), (8, 16), (8, 19), (9, 13), (10, 18), (13, 19), (16, 18), what is its diameter, the length of the longest shortest path between any two nodes (None if the graph is not connected)? Return the answer in \boxed{} format. If the answer is a floating point number, round it to 2 decimal places. If the graph is not connected and the property is undefined, return 'None'. | {"task": "diameter", "samples": 40, "graph_type": "undirected", "num_workers": 1} | "None" |
0diameter
| 1undirected
| Given an undirected graph with edges (0, 1), (0, 5), (0, 6), (0, 11), (0, 12), (1, 4), (1, 7), (1, 8), (1, 9), (2, 4), (2, 8), (2, 9), (2, 10), (2, 11), (2, 12), (3, 5), (3, 9), (3, 12), (4, 6), (4, 8), (4, 10), (4, 11), (4, 12), (4, 13), (5, 6), (5, 8), (5, 11), (6, 8), (6, 9), (6, 10), (6, 11), (6, 12), (6, 13), (8, 12), (10, 11), (10, 13), what is its diameter, the length of the longest shortest path between any two nodes (None if the graph is not connected)? Return the answer in \boxed{} format. If the answer is a floating point number, round it to 2 decimal places. If the graph is not connected and the property is undefined, return 'None'. | {"task": "diameter", "samples": 40, "graph_type": "undirected", "num_workers": 1} | "3" |
0diameter
| 1undirected
| Given an undirected graph with edges (0, 1), (0, 2), (0, 9), (1, 7), (1, 11), (1, 12), (1, 15), (2, 6), (2, 10), (3, 4), (3, 11), (4, 15), (5, 15), (8, 15), (11, 13), (12, 15), (13, 16), what is its diameter, the length of the longest shortest path between any two nodes (None if the graph is not connected)? Return the answer in \boxed{} format. If the answer is a floating point number, round it to 2 decimal places. If the graph is not connected and the property is undefined, return 'None'. | {"task": "diameter", "samples": 40, "graph_type": "undirected", "num_workers": 1} | "None" |
0diameter
| 1undirected
| Given an undirected graph with edges (0, 2), (0, 4), (0, 7), (0, 8), (0, 9), (0, 11), (0, 12), (0, 14), (1, 3), (1, 4), (1, 11), (1, 16), (2, 5), (2, 16), (2, 18), (3, 7), (3, 15), (3, 17), (3, 18), (4, 6), (4, 11), (5, 10), (5, 13), (5, 14), (5, 18), (6, 7), (6, 9), (6, 14), (7, 10), (7, 12), (7, 15), (8, 12), (8, 13), (8, 14), (8, 15), (8, 17), (9, 13), (9, 15), (10, 12), (10, 14), (10, 16), (11, 15), (12, 13), (12, 15), (12, 16), (12, 18), what is its diameter, the length of the longest shortest path between any two nodes (None if the graph is not connected)? Return the answer in \boxed{} format. If the answer is a floating point number, round it to 2 decimal places. If the graph is not connected and the property is undefined, return 'None'. | {"task": "diameter", "samples": 40, "graph_type": "undirected", "num_workers": 1} | "3" |
0diameter
| 1undirected
| Given an undirected graph with edges (0, 6), (0, 8), (0, 9), (0, 10), (0, 11), (0, 17), (1, 9), (1, 11), (1, 15), (1, 16), (2, 3), (2, 4), (2, 5), (2, 8), (2, 10), (2, 14), (3, 5), (3, 10), (3, 16), (3, 17), (4, 10), (4, 11), (4, 16), (5, 9), (5, 15), (6, 7), (6, 11), (6, 12), (6, 13), (6, 17), (7, 12), (7, 15), (8, 11), (8, 12), (9, 13), (9, 17), (10, 12), (10, 14), (11, 12), (12, 13), (14, 17), what is its diameter, the length of the longest shortest path between any two nodes (None if the graph is not connected)? Return the answer in \boxed{} format. If the answer is a floating point number, round it to 2 decimal places. If the graph is not connected and the property is undefined, return 'None'. | {"task": "diameter", "samples": 40, "graph_type": "undirected", "num_workers": 1} | "3" |
0diameter
| 1undirected
| Given an undirected graph with edges (0, 7), (1, 11), (2, 7), (2, 16), (3, 13), (3, 17), (4, 5), (4, 7), (4, 11), (5, 9), (5, 10), (5, 12), (5, 16), (7, 14), (7, 17), (8, 12), (8, 14), (8, 16), (9, 10), (9, 14), (11, 17), (12, 16), what is its diameter, the length of the longest shortest path between any two nodes (None if the graph is not connected)? Return the answer in \boxed{} format. If the answer is a floating point number, round it to 2 decimal places. If the graph is not connected and the property is undefined, return 'None'. | {"task": "diameter", "samples": 40, "graph_type": "undirected", "num_workers": 1} | "None" |
0diameter
| 1undirected
| Given an undirected graph with edges (0, 4), (0, 9), (0, 10), (0, 11), (1, 5), (1, 9), (1, 10), (1, 11), (2, 6), (2, 11), (3, 4), (3, 6), (3, 7), (3, 8), (3, 9), (3, 11), (4, 5), (4, 6), (5, 7), (5, 8), (5, 9), (5, 10), (6, 7), (6, 9), (7, 9), (7, 10), (8, 9), what is its diameter, the length of the longest shortest path between any two nodes (None if the graph is not connected)? Return the answer in \boxed{} format. If the answer is a floating point number, round it to 2 decimal places. If the graph is not connected and the property is undefined, return 'None'. | {"task": "diameter", "samples": 40, "graph_type": "undirected", "num_workers": 1} | "3" |
0diameter
| 1undirected
| Given an undirected graph with edges (0, 1), (0, 2), (0, 4), (0, 5), (0, 9), (0, 10), (1, 3), (1, 10), (1, 11), (2, 3), (2, 6), (2, 8), (2, 10), (2, 12), (3, 4), (3, 7), (3, 8), (3, 10), (3, 13), (4, 6), (4, 10), (4, 11), (4, 13), (5, 13), (6, 8), (6, 10), (6, 12), (6, 13), (7, 11), (8, 9), (8, 10), (8, 11), (8, 12), (9, 10), (10, 11), (11, 12), what is its diameter, the length of the longest shortest path between any two nodes (None if the graph is not connected)? Return the answer in \boxed{} format. If the answer is a floating point number, round it to 2 decimal places. If the graph is not connected and the property is undefined, return 'None'. | {"task": "diameter", "samples": 40, "graph_type": "undirected", "num_workers": 1} | "3" |
0diameter
| 1undirected
| Given an undirected graph with edges (0, 5), (1, 4), (1, 8), (2, 4), (2, 5), (2, 7), (3, 9), what is its diameter, the length of the longest shortest path between any two nodes (None if the graph is not connected)? Return the answer in \boxed{} format. If the answer is a floating point number, round it to 2 decimal places. If the graph is not connected and the property is undefined, return 'None'. | {"task": "diameter", "samples": 40, "graph_type": "undirected", "num_workers": 1} | "None" |
0diameter
| 1undirected
| Given an undirected graph with edges (1, 8), (1, 14), (1, 16), (2, 4), (2, 8), (2, 15), (3, 7), (3, 11), (3, 14), (4, 9), (4, 13), (5, 11), (5, 15), (7, 11), (7, 16), (8, 17), (10, 12), (12, 13), (14, 17), (16, 17), what is its diameter, the length of the longest shortest path between any two nodes (None if the graph is not connected)? Return the answer in \boxed{} format. If the answer is a floating point number, round it to 2 decimal places. If the graph is not connected and the property is undefined, return 'None'. | {"task": "diameter", "samples": 40, "graph_type": "undirected", "num_workers": 1} | "None" |
0diameter
| 1undirected
| Given an undirected graph with edges (0, 3), (0, 16), (1, 2), (1, 9), (1, 10), (1, 11), (1, 13), (2, 3), (2, 5), (2, 8), (2, 9), (2, 12), (2, 13), (3, 5), (3, 9), (3, 10), (3, 13), (3, 15), (4, 5), (4, 7), (4, 11), (4, 13), (4, 14), (5, 8), (5, 12), (5, 13), (5, 16), (6, 7), (6, 15), (6, 16), (7, 13), (8, 14), (8, 15), (9, 13), (9, 14), (10, 12), (11, 12), (11, 13), (11, 15), what is its diameter, the length of the longest shortest path between any two nodes (None if the graph is not connected)? Return the answer in \boxed{} format. If the answer is a floating point number, round it to 2 decimal places. If the graph is not connected and the property is undefined, return 'None'. | {"task": "diameter", "samples": 40, "graph_type": "undirected", "num_workers": 1} | "3" |
0diameter
| 1undirected
| Given an undirected graph with edges (0, 1), (0, 3), (0, 4), (0, 10), (1, 4), (2, 10), (3, 5), (4, 5), (4, 10), (5, 10), (6, 7), (6, 9), (6, 10), (7, 9), (7, 10), what is its diameter, the length of the longest shortest path between any two nodes (None if the graph is not connected)? Return the answer in \boxed{} format. If the answer is a floating point number, round it to 2 decimal places. If the graph is not connected and the property is undefined, return 'None'. | {"task": "diameter", "samples": 40, "graph_type": "undirected", "num_workers": 1} | "None" |
0diameter
| 1undirected
| Given an undirected graph with edges (0, 4), (0, 5), (0, 7), (0, 10), (0, 11), (1, 2), (1, 3), (1, 4), (1, 5), (1, 9), (1, 10), (1, 12), (1, 13), (2, 4), (2, 8), (2, 13), (3, 5), (3, 7), (3, 10), (3, 11), (3, 13), (3, 14), (4, 5), (4, 7), (4, 9), (4, 13), (5, 7), (5, 10), (5, 12), (5, 13), (5, 14), (6, 7), (6, 8), (6, 12), (6, 13), (7, 8), (7, 13), (7, 14), (8, 9), (8, 10), (8, 13), (9, 10), (9, 11), (9, 12), (9, 13), (10, 11), (10, 13), (11, 12), (12, 13), what is its diameter, the length of the longest shortest path between any two nodes (None if the graph is not connected)? Return the answer in \boxed{} format. If the answer is a floating point number, round it to 2 decimal places. If the graph is not connected and the property is undefined, return 'None'. | {"task": "diameter", "samples": 40, "graph_type": "undirected", "num_workers": 1} | "3" |
0diameter
| 1undirected
| Given an undirected graph with edges (0, 3), (0, 6), (0, 8), (1, 5), (1, 7), (1, 10), (1, 11), (2, 5), (3, 9), (3, 10), (3, 11), (4, 7), (4, 11), (8, 10), what is its diameter, the length of the longest shortest path between any two nodes (None if the graph is not connected)? Return the answer in \boxed{} format. If the answer is a floating point number, round it to 2 decimal places. If the graph is not connected and the property is undefined, return 'None'. | {"task": "diameter", "samples": 40, "graph_type": "undirected", "num_workers": 1} | "6" |
0diameter
| 1undirected
| Given an undirected graph with edges (0, 2), (0, 6), (0, 9), (0, 11), (0, 12), (0, 15), (1, 2), (1, 6), (1, 10), (1, 11), (1, 12), (1, 14), (2, 3), (2, 6), (2, 10), (2, 12), (2, 17), (3, 6), (3, 7), (3, 14), (3, 16), (3, 17), (4, 6), (4, 7), (4, 13), (4, 16), (4, 17), (5, 9), (5, 11), (5, 13), (5, 15), (5, 16), (6, 7), (6, 8), (6, 10), (6, 11), (6, 12), (6, 16), (7, 11), (7, 15), (8, 10), (8, 17), (9, 11), (9, 13), (9, 14), (9, 15), (9, 16), (9, 17), (10, 17), (11, 14), (11, 16), (11, 17), (12, 14), (12, 16), (12, 17), (14, 17), (15, 16), what is its diameter, the length of the longest shortest path between any two nodes (None if the graph is not connected)? Return the answer in \boxed{} format. If the answer is a floating point number, round it to 2 decimal places. If the graph is not connected and the property is undefined, return 'None'. | {"task": "diameter", "samples": 40, "graph_type": "undirected", "num_workers": 1} | "3" |
0diameter
| 1undirected
| Given an undirected graph with edges (0, 4), (0, 5), (0, 9), (0, 14), (0, 15), (0, 16), (1, 2), (1, 9), (2, 4), (2, 12), (3, 6), (3, 7), (3, 9), (3, 13), (3, 15), (3, 17), (4, 18), (5, 7), (5, 8), (5, 11), (5, 12), (5, 16), (6, 13), (7, 11), (7, 18), (8, 10), (8, 13), (8, 16), (9, 17), (10, 15), (10, 18), (11, 13), (12, 15), (12, 16), (12, 18), (13, 15), (13, 17), (14, 15), (16, 18), (17, 18), what is its diameter, the length of the longest shortest path between any two nodes (None if the graph is not connected)? Return the answer in \boxed{} format. If the answer is a floating point number, round it to 2 decimal places. If the graph is not connected and the property is undefined, return 'None'. | {"task": "diameter", "samples": 40, "graph_type": "undirected", "num_workers": 1} | "4" |
0diameter
| 1undirected
| Given an undirected graph with edges (0, 1), (0, 2), (0, 5), (0, 9), (0, 10), (1, 2), (1, 3), (1, 4), (1, 6), (1, 8), (1, 9), (2, 5), (2, 6), (2, 10), (3, 6), (3, 8), (3, 10), (4, 6), (4, 9), (5, 9), (6, 7), (6, 8), (6, 9), what is its diameter, the length of the longest shortest path between any two nodes (None if the graph is not connected)? Return the answer in \boxed{} format. If the answer is a floating point number, round it to 2 decimal places. If the graph is not connected and the property is undefined, return 'None'. | {"task": "diameter", "samples": 40, "graph_type": "undirected", "num_workers": 1} | "3" |
0diameter
| 1undirected
| Given an undirected graph with edges (0, 6), (0, 7), (0, 8), (0, 10), (0, 16), (0, 17), (0, 18), (1, 2), (1, 4), (1, 6), (1, 8), (1, 13), (1, 14), (1, 16), (1, 18), (2, 4), (2, 9), (2, 11), (2, 15), (2, 18), (3, 4), (3, 6), (3, 10), (3, 11), (3, 12), (3, 14), (3, 18), (4, 6), (4, 10), (4, 11), (5, 8), (5, 9), (5, 10), (5, 12), (5, 13), (5, 18), (6, 10), (6, 11), (6, 13), (6, 14), (6, 15), (7, 9), (7, 11), (7, 13), (7, 16), (7, 18), (8, 10), (8, 12), (8, 15), (8, 18), (9, 10), (9, 16), (9, 18), (10, 13), (10, 15), (11, 14), (11, 17), (12, 14), (12, 16), (13, 16), (14, 16), (16, 18), what is its diameter, the length of the longest shortest path between any two nodes (None if the graph is not connected)? Return the answer in \boxed{} format. If the answer is a floating point number, round it to 2 decimal places. If the graph is not connected and the property is undefined, return 'None'. | {"task": "diameter", "samples": 40, "graph_type": "undirected", "num_workers": 1} | "3" |
0diameter
| 1undirected
| Given an undirected graph with edges (0, 1), (0, 2), (0, 3), (0, 4), (0, 5), (0, 10), (0, 13), (0, 16), (0, 18), (1, 2), (1, 3), (1, 4), (1, 5), (1, 6), (1, 13), (1, 14), (1, 15), (1, 16), (1, 18), (2, 5), (2, 8), (2, 11), (2, 15), (3, 4), (3, 8), (3, 9), (3, 10), (3, 14), (3, 16), (3, 17), (4, 9), (4, 10), (4, 12), (4, 14), (5, 6), (5, 9), (5, 10), (5, 13), (5, 14), (5, 16), (5, 17), (6, 9), (6, 13), (6, 15), (7, 8), (7, 12), (7, 13), (7, 15), (8, 10), (8, 12), (8, 13), (8, 14), (8, 15), (8, 16), (9, 11), (9, 12), (9, 15), (9, 17), (10, 12), (10, 14), (10, 15), (11, 12), (11, 14), (11, 16), (11, 17), (11, 18), (12, 14), (12, 16), (13, 14), (13, 15), (13, 16), (13, 17), (14, 15), (14, 17), (17, 18), what is its diameter, the length of the longest shortest path between any two nodes (None if the graph is not connected)? Return the answer in \boxed{} format. If the answer is a floating point number, round it to 2 decimal places. If the graph is not connected and the property is undefined, return 'None'. | {"task": "diameter", "samples": 40, "graph_type": "undirected", "num_workers": 1} | "3" |
1number_connected_components
| 0directed
| Given an undirected graph with edges (0, 5), (0, 6), (0, 9), (0, 13), (1, 6), (2, 11), (3, 10), (3, 12), (3, 14), (4, 7), (4, 10), (4, 11), (5, 14), (6, 7), (6, 9), (7, 9), (8, 13), (9, 11), what is its number of connected components, the number of connected components? Return the answer in \boxed{} format. If the answer is a floating point number, round it to 2 decimal places. If the graph is not connected and the property is undefined, return 'None'. | {"task": "number_connected_components", "samples": 40, "graph_type": "directed", "num_workers": 1} | "1" |
1number_connected_components
| 0directed
| Given an undirected graph with edges (0, 1), (0, 4), (0, 6), (0, 8), (0, 12), (1, 3), (1, 12), (1, 14), (2, 8), (2, 10), (2, 11), (2, 12), (3, 10), (4, 6), (4, 14), (5, 7), (5, 8), (5, 12), (5, 13), (7, 11), (8, 12), (8, 13), (9, 11), (9, 14), (11, 12), what is its number of connected components, the number of connected components? Return the answer in \boxed{} format. If the answer is a floating point number, round it to 2 decimal places. If the graph is not connected and the property is undefined, return 'None'. | {"task": "number_connected_components", "samples": 40, "graph_type": "directed", "num_workers": 1} | "1" |
1number_connected_components
| 0directed
| Given an undirected graph with edges (0, 10), (0, 16), (1, 12), (1, 14), (3, 5), (3, 8), (3, 12), (3, 13), (4, 6), (4, 13), (5, 7), (5, 8), (5, 12), (5, 15), (6, 12), (8, 16), (9, 10), (9, 14), (14, 16), what is its number of connected components, the number of connected components? Return the answer in \boxed{} format. If the answer is a floating point number, round it to 2 decimal places. If the graph is not connected and the property is undefined, return 'None'. | {"task": "number_connected_components", "samples": 40, "graph_type": "directed", "num_workers": 1} | "3" |
1number_connected_components
| 0directed
| Given an undirected graph with edges (0, 9), (1, 4), (4, 6), (4, 8), (4, 10), (4, 11), (5, 7), (6, 9), (7, 9), (7, 10), (9, 11), (10, 12), what is its number of connected components, the number of connected components? Return the answer in \boxed{} format. If the answer is a floating point number, round it to 2 decimal places. If the graph is not connected and the property is undefined, return 'None'. | {"task": "number_connected_components", "samples": 40, "graph_type": "directed", "num_workers": 1} | "3" |
1number_connected_components
| 0directed
| Given an undirected graph with edges (0, 1), (0, 2), (0, 4), (0, 5), (0, 6), (0, 8), (0, 9), (0, 12), (0, 13), (0, 16), (1, 3), (1, 4), (1, 5), (1, 6), (1, 7), (1, 9), (1, 10), (1, 12), (1, 13), (1, 14), (1, 15), (2, 10), (2, 11), (2, 14), (2, 16), (3, 4), (3, 6), (3, 9), (3, 10), (3, 11), (3, 12), (3, 13), (3, 14), (3, 16), (4, 5), (4, 7), (4, 8), (4, 10), (4, 11), (4, 13), (4, 15), (5, 7), (5, 8), (5, 10), (5, 12), (5, 13), (5, 14), (5, 15), (6, 10), (6, 11), (6, 13), (6, 16), (7, 10), (7, 11), (7, 12), (7, 14), (7, 15), (8, 9), (8, 10), (8, 14), (8, 15), (8, 16), (9, 11), (9, 12), (9, 15), (9, 16), (10, 14), (10, 15), (10, 16), (11, 14), (12, 13), (12, 15), (12, 16), (13, 14), (13, 15), (14, 15), (15, 16), what is its number of connected components, the number of connected components? Return the answer in \boxed{} format. If the answer is a floating point number, round it to 2 decimal places. If the graph is not connected and the property is undefined, return 'None'. | {"task": "number_connected_components", "samples": 40, "graph_type": "directed", "num_workers": 1} | "1" |
1number_connected_components
| 0directed
| Given an undirected graph with edges (0, 2), (0, 4), (0, 10), (0, 17), (0, 18), (1, 9), (1, 12), (1, 15), (2, 3), (2, 11), (2, 13), (2, 17), (2, 19), (3, 9), (3, 18), (4, 14), (4, 17), (5, 8), (5, 13), (5, 14), (5, 17), (5, 19), (6, 7), (6, 11), (6, 13), (6, 14), (6, 15), (6, 19), (7, 8), (7, 17), (8, 10), (8, 11), (8, 16), (8, 17), (9, 14), (9, 18), (10, 18), (11, 14), (11, 17), (12, 13), (12, 15), (14, 16), (15, 19), (16, 19), (17, 18), (17, 19), what is its number of connected components, the number of connected components? Return the answer in \boxed{} format. If the answer is a floating point number, round it to 2 decimal places. If the graph is not connected and the property is undefined, return 'None'. | {"task": "number_connected_components", "samples": 40, "graph_type": "directed", "num_workers": 1} | "1" |
1number_connected_components
| 0directed
| Given an undirected graph with edges (0, 1), (0, 2), (1, 2), (1, 10), (3, 11), (6, 8), (7, 9), (7, 10), (8, 12), (10, 12), what is its number of connected components, the number of connected components? Return the answer in \boxed{} format. If the answer is a floating point number, round it to 2 decimal places. If the graph is not connected and the property is undefined, return 'None'. | {"task": "number_connected_components", "samples": 40, "graph_type": "directed", "num_workers": 1} | "4" |
1number_connected_components
| 0directed
| Given an undirected graph with edges (0, 1), (0, 2), (0, 5), (0, 7), (1, 4), (1, 10), (2, 5), (2, 8), (3, 4), (3, 9), (4, 6), (4, 7), (4, 9), (4, 10), (6, 8), (6, 9), (7, 8), what is its number of connected components, the number of connected components? Return the answer in \boxed{} format. If the answer is a floating point number, round it to 2 decimal places. If the graph is not connected and the property is undefined, return 'None'. | {"task": "number_connected_components", "samples": 40, "graph_type": "directed", "num_workers": 1} | "1" |
1number_connected_components
| 0directed
| Given an undirected graph with edges (0, 7), (0, 8), (0, 10), (1, 3), (1, 6), (1, 9), (1, 10), (2, 5), (2, 10), (2, 11), (2, 12), (3, 4), (3, 5), (3, 7), (3, 8), (3, 9), (3, 11), (4, 7), (4, 10), (4, 11), (5, 6), (5, 9), (5, 10), (5, 12), (7, 8), (7, 9), (8, 9), (8, 11), (9, 11), (9, 12), (11, 12), what is its number of connected components, the number of connected components? Return the answer in \boxed{} format. If the answer is a floating point number, round it to 2 decimal places. If the graph is not connected and the property is undefined, return 'None'. | {"task": "number_connected_components", "samples": 40, "graph_type": "directed", "num_workers": 1} | "1" |
1number_connected_components
| 0directed
| Given an undirected graph with edges (0, 2), (0, 3), (0, 4), (0, 5), (0, 6), (0, 7), (0, 10), (0, 11), (1, 2), (1, 3), (1, 4), (1, 5), (1, 7), (1, 9), (2, 4), (2, 5), (2, 6), (2, 8), (2, 9), (2, 10), (2, 12), (3, 4), (3, 5), (3, 9), (3, 10), (3, 11), (3, 12), (4, 5), (4, 8), (4, 12), (5, 10), (5, 11), (6, 7), (6, 8), (7, 9), (7, 10), (8, 10), (8, 11), (8, 12), (10, 11), (10, 12), what is its number of connected components, the number of connected components? Return the answer in \boxed{} format. If the answer is a floating point number, round it to 2 decimal places. If the graph is not connected and the property is undefined, return 'None'. | {"task": "number_connected_components", "samples": 40, "graph_type": "directed", "num_workers": 1} | "1" |
1number_connected_components
| 0directed
| Given an undirected graph with edges (0, 8), (0, 13), (1, 6), (1, 9), (1, 11), (2, 3), (2, 8), (2, 16), (3, 7), (3, 8), (3, 13), (3, 15), (4, 8), (4, 13), (4, 17), (5, 18), (6, 13), (6, 14), (6, 17), (8, 11), (8, 12), (8, 16), (8, 17), (9, 10), (9, 12), (10, 13), (11, 12), (11, 16), (14, 16), (15, 16), what is its number of connected components, the number of connected components? Return the answer in \boxed{} format. If the answer is a floating point number, round it to 2 decimal places. If the graph is not connected and the property is undefined, return 'None'. | {"task": "number_connected_components", "samples": 40, "graph_type": "directed", "num_workers": 1} | "2" |
1number_connected_components
| 0directed
| Given an undirected graph with edges (0, 3), (0, 5), (0, 7), (0, 9), (1, 3), (1, 5), (1, 7), (1, 8), (1, 10), (2, 4), (2, 8), (2, 11), (3, 4), (3, 8), (3, 11), (4, 6), (4, 7), (4, 8), (4, 9), (5, 6), (5, 7), (5, 8), (6, 8), (6, 9), (6, 12), (8, 10), (8, 11), (9, 12), what is its number of connected components, the number of connected components? Return the answer in \boxed{} format. If the answer is a floating point number, round it to 2 decimal places. If the graph is not connected and the property is undefined, return 'None'. | {"task": "number_connected_components", "samples": 40, "graph_type": "directed", "num_workers": 1} | "1" |
1number_connected_components
| 0directed
| Given an undirected graph with edges (0, 2), (0, 14), (1, 5), (1, 11), (3, 4), (3, 8), (3, 10), (4, 6), (4, 14), (4, 15), (5, 7), (5, 14), (7, 11), (7, 13), (7, 14), (8, 11), (8, 16), (10, 12), (12, 16), what is its number of connected components, the number of connected components? Return the answer in \boxed{} format. If the answer is a floating point number, round it to 2 decimal places. If the graph is not connected and the property is undefined, return 'None'. | {"task": "number_connected_components", "samples": 40, "graph_type": "directed", "num_workers": 1} | "2" |
1number_connected_components
| 0directed
| Given an undirected graph with edges (0, 2), (0, 3), (0, 6), (0, 11), (0, 12), (1, 2), (1, 7), (2, 12), (3, 11), (4, 7), (4, 10), (6, 8), (6, 9), (6, 10), (6, 13), (7, 13), (10, 13), (11, 13), what is its number of connected components, the number of connected components? Return the answer in \boxed{} format. If the answer is a floating point number, round it to 2 decimal places. If the graph is not connected and the property is undefined, return 'None'. | {"task": "number_connected_components", "samples": 40, "graph_type": "directed", "num_workers": 1} | "2" |
1number_connected_components
| 0directed
| Given an undirected graph with edges (0, 14), (0, 17), (1, 10), (1, 11), (1, 16), (1, 18), (2, 6), (2, 15), (2, 17), (3, 12), (3, 13), (3, 14), (3, 15), (4, 18), (6, 7), (6, 8), (6, 11), (6, 16), (7, 9), (7, 11), (7, 17), (8, 13), (8, 17), (9, 11), (11, 15), (12, 14), (13, 15), (13, 16), (14, 15), (14, 16), (15, 17), (15, 18), what is its number of connected components, the number of connected components? Return the answer in \boxed{} format. If the answer is a floating point number, round it to 2 decimal places. If the graph is not connected and the property is undefined, return 'None'. | {"task": "number_connected_components", "samples": 40, "graph_type": "directed", "num_workers": 1} | "2" |
1number_connected_components
| 0directed
| Given an undirected graph with edges (0, 3), (0, 4), (0, 9), (1, 7), (1, 10), (2, 4), (2, 9), (2, 10), (2, 12), (3, 4), (3, 5), (3, 6), (3, 8), (3, 11), (4, 8), (4, 10), (4, 12), (5, 8), (5, 11), (6, 11), (7, 10), (7, 12), (8, 10), (9, 12), (10, 12), what is its number of connected components, the number of connected components? Return the answer in \boxed{} format. If the answer is a floating point number, round it to 2 decimal places. If the graph is not connected and the property is undefined, return 'None'. | {"task": "number_connected_components", "samples": 40, "graph_type": "directed", "num_workers": 1} | "1" |
1number_connected_components
| 0directed
| Given an undirected graph with edges (0, 4), (1, 2), (2, 7), (2, 8), (3, 5), (3, 8), (4, 10), (8, 9), (9, 10), what is its number of connected components, the number of connected components? Return the answer in \boxed{} format. If the answer is a floating point number, round it to 2 decimal places. If the graph is not connected and the property is undefined, return 'None'. | {"task": "number_connected_components", "samples": 40, "graph_type": "directed", "num_workers": 1} | "3" |
1number_connected_components
| 0directed
| Given an undirected graph with edges (0, 2), (0, 3), (0, 7), (2, 5), (2, 7), (2, 10), (5, 7), (5, 10), (5, 11), (6, 8), (6, 11), (10, 11), what is its number of connected components, the number of connected components? Return the answer in \boxed{} format. If the answer is a floating point number, round it to 2 decimal places. If the graph is not connected and the property is undefined, return 'None'. | {"task": "number_connected_components", "samples": 40, "graph_type": "directed", "num_workers": 1} | "4" |
1number_connected_components
| 0directed
| Given an undirected graph with edges (0, 5), (0, 10), (1, 2), (1, 9), (1, 14), (2, 3), (2, 5), (2, 11), (3, 11), (4, 11), (5, 8), (5, 9), (5, 13), (5, 14), (6, 8), (7, 11), (7, 14), (8, 10), (8, 14), (9, 12), (13, 14), what is its number of connected components, the number of connected components? Return the answer in \boxed{} format. If the answer is a floating point number, round it to 2 decimal places. If the graph is not connected and the property is undefined, return 'None'. | {"task": "number_connected_components", "samples": 40, "graph_type": "directed", "num_workers": 1} | "1" |
1number_connected_components
| 0directed
| Given an undirected graph with edges (0, 1), (0, 6), (0, 11), (1, 3), (1, 4), (1, 5), (1, 7), (1, 11), (2, 4), (2, 6), (2, 8), (2, 9), (3, 7), (3, 8), (3, 11), (4, 5), (4, 6), (4, 8), (4, 11), (6, 7), (6, 9), (6, 11), (7, 10), (8, 10), (9, 11), what is its number of connected components, the number of connected components? Return the answer in \boxed{} format. If the answer is a floating point number, round it to 2 decimal places. If the graph is not connected and the property is undefined, return 'None'. | {"task": "number_connected_components", "samples": 40, "graph_type": "directed", "num_workers": 1} | "1" |