prompts stringlengths 279 11.1k | answers stringlengths 1 254 | tasks stringclasses 47 values |
|---|---|---|
The task is to determine the number of nodes in the graph.
Here is an undirected graph. In the graph, (u, v) means that node u and node v are connected. The graph contains nodes: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, and 18. The graph contains edges: (1, 9), (1, 18), (4, 9), (9, 15), (2, 11), (3, 11), (5, 11), (7, 11), (11, 12), (3, 12), (3, 7), (3, 5), (7, 12), (5, 17), (5, 13), (4, 8), (4, 15), (4, 10), (6, 8), (8, 14), (8, 15), (8, 10), (10, 15), (15, 16), (10, 14), (13, 17), (6, 14).
Question: How many nodes are there in the graph?
| 18 | graph_node_number |
The task is to determine the maximal independent set guaranteed to contain a given node in the graph.
An independent set is a set of nodes such that the subgraph induced by these nodes contains no edges. A maximal independent set is an independent set such that it is not possible to add a new node and still get an independent set.
Here is an undirected graph. In the graph, (u, v) means that node u and node v are connected. The graph contains nodes: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, and 13. The graph contains edges: (1, 4), (1, 5), (3, 4), (4, 5), (2, 7), (6, 7), (3, 8), (6, 12), (10, 12), (11, 12), (9, 13), (11, 13), (10, 11).
Question: What is the maximal independent set that includes node 3 of the graph?
You need to format your answer as a list of nodes in ascending order, e.g., [node-1, node-2, ..., node-n]. | [2,3,5,6,10,13] | graph_maximal_independent_set |
The task is to determine the number of isolated nodes in the graph.
An isolated node is a node that has no edges connecting it to any other nodes.
Here is a directed graph. In the graph, (u, v) means that there is an edge from node u to node v. The graph contains nodes: 1, 2, 3, 4, and 5. The graph contains edges: (2, 5), (5, 4), (3, 1).
Question: How many isolated nodes are there in the graph?
| 0 | graph_isolate_number |
The task is to determine the neighbors of a node in the graph.
Here is an undirected graph. In the graph, (u, v) means that node u and node v are connected. The graph contains nodes: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, and 16. The graph contains edges: (1, 3), (1, 13), (1, 16), (1, 5), (1, 4), (1, 7), (1, 8), (1, 9), (1, 11), (2, 3), (3, 13), (3, 16), (3, 5), (3, 4), (3, 7), (3, 8), (3, 9), (3, 11), (3, 10), (3, 15), (3, 14), (3, 12), (3, 6), (2, 13), (4, 13), (5, 13), (6, 13), (7, 13), (8, 13), (9, 13), (10, 13), (11, 13), (12, 13), (13, 16), (13, 15), (2, 16), (4, 16), (5, 16), (7, 16), (8, 16), (9, 16), (10, 16), (11, 16), (12, 16), (14, 16), (4, 5), (5, 7), (5, 8), (5, 9), (5, 11), (5, 10), (5, 15), (5, 14), (5, 12), (5, 6), (2, 4), (4, 7), (4, 8), (4, 9), (4, 11), (4, 10), (4, 15), (4, 14), (4, 12), (4, 6), (2, 7), (7, 8), (7, 9), (7, 11), (7, 10), (7, 15), (7, 14), (2, 8), (6, 8), (8, 9), (8, 11), (8, 10), (8, 14), (8, 12), (2, 9), (9, 11), (9, 10), (9, 15), (9, 12), (2, 11), (10, 11), (11, 14), (2, 10), (2, 6), (6, 10), (10, 14), (10, 12).
Question: What are the neighbors of node 11 in the graph?
You need to format your answer as a list of nodes in ascending order, e.g., [node-1, node-2, ..., node-n]. | [1,2,3,4,5,7,8,9,10,13,14,16] | graph_neighbor |
The task is to determine the barycenter of a graph.
The barycenter of a graph is also called the median. It includes the node that minimizes the sum of distances to all other nodes.
Here is an undirected graph. In the graph, (u, v) means that node u and node v are connected. The graph contains nodes: 1, 2, 3, 4, 5, 6, 7, 8, 9, and 10. The graph contains edges: (1, 4), (1, 7), (1, 8), (1, 10), (2, 4), (3, 4), (4, 9), (4, 7), (4, 6), (4, 8), (4, 10), (2, 7), (3, 7), (6, 7), (7, 8), (7, 10), (2, 8), (3, 8), (5, 8), (6, 8), (8, 10), (2, 10), (3, 10), (5, 10), (6, 10), (2, 6), (2, 5), (2, 3), (3, 6), (6, 9), (3, 5).
Question: What is the barycenter of the graph?
You need to format your answer as a list of nodes in ascending order, e.g., [node-1, node-2, ..., node-n]. | [4,8,10] | graph_barycenter |
The task is to determine the harmonic centrality of a node in the graph.
Harmonic centrality of a node u is the sum of the reciprocal of the shortest path distances from all other nodes to u (direction is not considered for undirected graphs).
Here is an undirected graph. In the graph, (u, v) means that node u and node v are connected. The graph contains nodes: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, and 14. The graph contains edges: (1, 11), (1, 13), (10, 11), (2, 3), (2, 4), (2, 6), (2, 7), (4, 14), (5, 9), (5, 8), (10, 12).
Question: What is the harmonic centrality of node 13 in the graph?
You need to format your answer as a float number. | 2.083333333333333 | graph_harmonic_centrality |
The task is to determine the local connectivity of two nodes in the graph.
Local connectivity is whether there exists at least one path between the two nodes.
Here is an undirected graph. In the graph, (u, v) means that node u and node v are connected. The graph contains nodes: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, and 33. The graph contains edges: (1, 2), (1, 5), (1, 6), (1, 3), (1, 4), (2, 3), (2, 4), (3, 5), (5, 6), (5, 32), (3, 6), (6, 32), (3, 32), (4, 17), (4, 7), (7, 17), (16, 17), (17, 22), (17, 33), (17, 23), (7, 22), (7, 16), (16, 22), (18, 22), (22, 26), (22, 23), (16, 33), (16, 23), (16, 24), (8, 9), (8, 10), (8, 13), (8, 14), (9, 10), (9, 11), (9, 12), (10, 12), (13, 15), (13, 14), (14, 15), (11, 28), (11, 30), (11, 31), (11, 12), (12, 31), (28, 29), (28, 30), (30, 31), (18, 23), (20, 23), (23, 24), (18, 24), (20, 24), (24, 25), (18, 19), (18, 20), (18, 25), (19, 20), (19, 21), (20, 25), (21, 27), (26, 27).
Question: What is the local connectivity between node 6 and node 15 in the graph?
| No | graph_local_connectivity |
The task is to determine common neighbors between two nodes in the graph.
Here is an undirected graph. In the graph, (u, v) means that node u and node v are connected. The graph contains nodes: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, and 23. The graph contains edges: (1, 4), (1, 11), (1, 12), (1, 22), (2, 4), (4, 7), (4, 10), (4, 13), (4, 17), (4, 8), (4, 14), (4, 16), (4, 18), (11, 20), (11, 16), (6, 12), (10, 12), (12, 22), (12, 13), (12, 17), (12, 20), (12, 16), (12, 18), (12, 21), (2, 22), (6, 22), (8, 22), (10, 22), (13, 22), (14, 22), (16, 22), (17, 22), (18, 22), (20, 22), (21, 22), (2, 13), (2, 17), (2, 8), (2, 23), (5, 13), (8, 13), (13, 15), (13, 17), (3, 17), (8, 17), (14, 17), (17, 23), (17, 18), (8, 10), (8, 14), (8, 16), (8, 18), (7, 10), (9, 10), (14, 15), (14, 19), (5, 16), (18, 20), (6, 15), (9, 21).
Question: What are the common neighbors between node 12 and node 9?
You need to format your answer as a list of nodes in ascending order, e.g., [node-1, node-2, ..., node-n]. | [10,21] | graph_common_neighbor |
The task is to determine the neighbors of a node in the graph.
Here is an undirected graph. In the graph, (u, v) means that node u and node v are connected. The graph contains nodes: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, and 24. The graph contains edges: (1, 5), (5, 7), (5, 15), (2, 14), (14, 19), (3, 21), (21, 22), (4, 20), (12, 20), (7, 17), (6, 16), (6, 8), (6, 10), (11, 16), (9, 10), (17, 18), (11, 22), (12, 18), (13, 24), (23, 24), (19, 23).
Question: What are the neighbors of node 13 in the graph?
You need to format your answer as a list of nodes in ascending order, e.g., [node-1, node-2, ..., node-n]. | [24] | graph_neighbor |
The task is to determine the degree of a node in the graph. For the undirected graph, you should count the edge between two nodes only once.
Here is an undirected graph. In the graph, (u, v) means that node u and node v are connected. The graph contains nodes: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, and 28. The graph contains edges: (1, 22), (1, 11), (11, 21), (2, 9), (2, 10), (2, 4), (4, 9), (10, 14), (4, 17), (3, 8), (3, 13), (5, 8), (13, 28), (16, 17), (5, 26), (6, 20), (6, 25), (12, 25), (7, 16), (14, 15), (21, 23), (12, 23), (18, 28), (15, 19), (18, 27), (18, 24).
Question: What is the degree of node 14 in the graph?
| 2 | graph_degree |
The task is to determine the center of a graph.
The center of a graph includes the node that minimizes the maximum distance to all other nodes.
Here is an undirected graph. In the graph, (u, v) means that node u and node v are connected. The graph contains nodes: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, and 28. The graph contains edges: (1, 2), (1, 4), (1, 5), (1, 7), (1, 8), (1, 9), (2, 3), (2, 4), (2, 5), (2, 6), (3, 4), (4, 5), (4, 7), (4, 9), (4, 11), (3, 5), (5, 7), (5, 6), (7, 8), (7, 9), (7, 26), (8, 9), (8, 24), (8, 25), (8, 26), (9, 24), (9, 25), (9, 26), (3, 10), (3, 6), (3, 11), (3, 12), (3, 13), (6, 10), (6, 12), (6, 13), (10, 12), (10, 13), (11, 28), (11, 20), (11, 21), (11, 12), (12, 20), (12, 13), (23, 26), (24, 26), (25, 26), (23, 24), (24, 25), (23, 25), (20, 28), (21, 28), (15, 20), (15, 21), (21, 27), (14, 15), (14, 16), (14, 18), (14, 19), (14, 17), (15, 17), (16, 18), (16, 19), (18, 22), (18, 19), (19, 22).
Question: What is the center of the graph?
You need to format your answer as a list of nodes in ascending order, e.g., [node-1, node-2, ..., node-n]. | [11,12,20,21,28] | graph_center |
The task is to determine if the graph is bipartite.
A bipartite graph is a graph whose nodes can be divided into two disjoint sets such that no two graph vertices within the same set are adjacent.
Here is an undirected graph. In the graph, (u, v) means that node u and node v are connected. The graph contains nodes: 1, 2, 3, 4, and 5. The graph contains edges: (1, 2), (1, 5), (2, 3), (3, 4).
Question: Is the graph bipartite?
Your answer should be Yes or No. | Yes | graph_is_bipartite |
The task is to determine the number of strongly connected components in a directed graph.
A strongly connected component is a maximal subgraph where every node is reachable from every other node.
Here is a directed graph. In the graph, (u, v) means that there is an edge from node u to node v. The graph contains nodes: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, and 31. The graph contains edges: (1, 8), (1, 2), (1, 10), (1, 20), (1, 18), (1, 29), (1, 27), (8, 6), (8, 2), (8, 3), (8, 4), (8, 10), (8, 21), (8, 5), (8, 23), (8, 25), (8, 1), (8, 30), (8, 15), (8, 29), (8, 31), (8, 28), (8, 27), (8, 13), (2, 6), (2, 8), (2, 3), (2, 4), (2, 9), (2, 16), (2, 21), (2, 23), (2, 25), (2, 11), (2, 12), (2, 26), (2, 28), (2, 27), (2, 13), (2, 14), (10, 6), (10, 8), (10, 2), (10, 3), (10, 4), (10, 9), (10, 24), (10, 20), (10, 21), (10, 5), (10, 23), (10, 25), (10, 1), (10, 12), (10, 17), (10, 30), (10, 15), (10, 29), (10, 31), (10, 28), (10, 27), (10, 13), (20, 8), (20, 3), (20, 4), (20, 10), (20, 5), (20, 23), (20, 29), (20, 22), (20, 27), (18, 3), (18, 10), (18, 21), (18, 27), (29, 6), (29, 8), (29, 2), (29, 4), (29, 9), (29, 10), (29, 20), (29, 21), (29, 5), (29, 23), (29, 25), (29, 12), (29, 30), (29, 15), (29, 19), (29, 26), (29, 27), (29, 13), (27, 6), (27, 8), (27, 2), (27, 3), (27, 4), (27, 9), (27, 10), (27, 16), (27, 20), (27, 21), (27, 5), (27, 23), (27, 25), (27, 11), (27, 1), (27, 18), (27, 12), (27, 30), (27, 15), (27, 7), (27, 29), (27, 13), (6, 8), (6, 2), (6, 3), (6, 4), (6, 9), (6, 10), (6, 21), (6, 5), (6, 23), (6, 25), (6, 30), (6, 15), (6, 29), (6, 28), (6, 22), (6, 27), (6, 13), (3, 6), (3, 8), (3, 2), (3, 4), (3, 10), (3, 16), (3, 24), (3, 20), (3, 21), (3, 23), (3, 25), (3, 11), (3, 12), (3, 17), (3, 30), (3, 29), (3, 28), (3, 27), (3, 13), (4, 6), (4, 8), (4, 2), (4, 3), (4, 9), (4, 10), (4, 16), (4, 21), (4, 5), (4, 23), (4, 25), (4, 11), (4, 12), (4, 30), (4, 26), (4, 29), (4, 31), (4, 28), (4, 27), (4, 13), (4, 14), (9, 8), (9, 3), (9, 4), (9, 10), (9, 5), (9, 23), (9, 25), (9, 11), (9, 12), (9, 17), (9, 30), (9, 29), (9, 13), (16, 2), (16, 3), (16, 4), (16, 10), (16, 21), (16, 23), (16, 25), (16, 12), (16, 30), (16, 19), (16, 29), (16, 28), (16, 13), (21, 6), (21, 8), (21, 2), (21, 3), (21, 4), (21, 9), (21, 10), (21, 24), (21, 5), (21, 23), (21, 25), (21, 12), (21, 30), (21, 15), (21, 26), (21, 29), (21, 27), (21, 13), (23, 6), (23, 8), (23, 2), (23, 3), (23, 4), (23, 9), (23, 10), (23, 16), (23, 21), (23, 5), (23, 25), (23, 11), (23, 12), (23, 17), (23, 30), (23, 15), (23, 19), (23, 29), (23, 28), (23, 27), (23, 13), (23, 14), (25, 8), (25, 2), (25, 3), (25, 10), (25, 16), (25, 20), (25, 21), (25, 5), (25, 23), (25, 11), (25, 30), (25, 15), (25, 7), (25, 19), (25, 29), (25, 28), (25, 27), (25, 13), (11, 2), (11, 3), (11, 10), (11, 16), (11, 5), (11, 23), (11, 25), (11, 29), (12, 6), (12, 8), (12, 2), (12, 3), (12, 4), (12, 9), (12, 10), (12, 16), (12, 21), (12, 5), (12, 23), (12, 30), (12, 26), (12, 29), (12, 27), (12, 13), (12, 14), (26, 2), (26, 3), (26, 4), (26, 9), (26, 10), (26, 21), (26, 23), (26, 25), (26, 12), (26, 17), (26, 19), (26, 29), (26, 27), (26, 13), (28, 6), (28, 4), (28, 9), (28, 10), (28, 5), (28, 12), (28, 30), (28, 15), (28, 19), (28, 31), (28, 27), (28, 13), (13, 6), (13, 8), (13, 2), (13, 3), (13, 4), (13, 9), (13, 10), (13, 21), (13, 5), (13, 23), (13, 25), (13, 11), (13, 12), (13, 30), (13, 15), (13, 7), (13, 19), (13, 26), (13, 29), (13, 31), (13, 28), (13, 27), (13, 14), (14, 3), (14, 21), (14, 23), (14, 25), (14, 12), (14, 29), (14, 13), (24, 3), (24, 4), (24, 10), (24, 5), (24, 23), (24, 25), (24, 12), (24, 27), (24, 13), (17, 2), (17, 3), (17, 4), (17, 10), (17, 23), (17, 11), (17, 12), (17, 30), (17, 26), (17, 27), (17, 13), (30, 6), (30, 8), (30, 2), (30, 3), (30, 4), (30, 10), (30, 16), (30, 21), (30, 5), (30, 23), (30, 25), (30, 12), (30, 15), (30, 19), (30, 29), (30, 28), (30, 27), (30, 13), (5, 4), (5, 10), (5, 21), (5, 23), (5, 25), (5, 29), (5, 27), (5, 13), (5, 14), (31, 8), (31, 3), (31, 4), (31, 10), (31, 21), (31, 23), (31, 30), (31, 15), (31, 29), (31, 28), (31, 13), (15, 6), (15, 4), (15, 9), (15, 10), (15, 24), (15, 21), (15, 5), (15, 30), (15, 22), (15, 27), (15, 13), (22, 2), (22, 21), (22, 17), (22, 15), (7, 3), (7, 10), (7, 21), (7, 5), (7, 23), (7, 19), (7, 13), (19, 8), (19, 3), (19, 4), (19, 10), (19, 16), (19, 21), (19, 23), (19, 7), (19, 27), (19, 13).
Question: How many strongly connected components are there in the graph?
| 1 | graph_strongly_connected_number |
The task is to determine the global efficiency of a graph.
Global efficiency is the average of the inverse shortest path lengths between all pairs of nodes in the graph.
Here is an undirected graph. In the graph, (u, v) means that node u and node v are connected. The graph contains nodes: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, and 33. The graph contains edges: (1, 2), (1, 3), (1, 5), (1, 6), (1, 7), (1, 8), (1, 10), (1, 11), (1, 15), (1, 16), (1, 17), (1, 20), (1, 22), (1, 23), (1, 25), (1, 18), (1, 24), (1, 26), (1, 30), (1, 13), (1, 29), (1, 32), (1, 19), (1, 27), (1, 14), (1, 31), (1, 33), (1, 9), (2, 3), (2, 5), (2, 6), (2, 7), (2, 8), (2, 10), (2, 11), (2, 15), (2, 16), (2, 17), (2, 20), (2, 22), (2, 23), (2, 25), (2, 24), (2, 26), (2, 30), (2, 13), (2, 32), (2, 4), (2, 19), (2, 27), (2, 28), (2, 14), (2, 31), (2, 12), (2, 33), (2, 9), (3, 5), (3, 6), (3, 7), (3, 8), (3, 10), (3, 11), (3, 15), (3, 16), (3, 17), (3, 20), (3, 22), (3, 23), (3, 25), (3, 18), (3, 13), (3, 21), (3, 29), (3, 32), (3, 4), (3, 27), (3, 28), (3, 31), (3, 12), (3, 33), (3, 9), (4, 5), (5, 6), (5, 7), (5, 8), (5, 10), (5, 11), (5, 15), (5, 16), (5, 17), (5, 20), (5, 22), (5, 23), (5, 25), (5, 18), (5, 24), (5, 30), (5, 13), (5, 21), (5, 29), (5, 32), (5, 19), (5, 27), (5, 28), (5, 14), (5, 31), (5, 12), (5, 33), (5, 9), (4, 6), (6, 7), (6, 8), (6, 10), (6, 11), (6, 15), (6, 16), (6, 17), (6, 20), (6, 22), (6, 23), (6, 25), (6, 18), (6, 24), (6, 26), (6, 13), (6, 21), (6, 29), (6, 27), (6, 28), (6, 14), (6, 31), (6, 12), (4, 7), (7, 8), (7, 10), (7, 11), (7, 15), (7, 16), (7, 17), (7, 20), (7, 22), (7, 23), (7, 25), (7, 18), (7, 24), (7, 26), (7, 30), (7, 13), (7, 21), (7, 29), (7, 32), (7, 19), (7, 28), (7, 31), (7, 12), (4, 8), (8, 10), (8, 11), (8, 15), (8, 16), (8, 17), (8, 20), (8, 22), (8, 23), (8, 25), (8, 24), (8, 26), (8, 30), (8, 13), (8, 21), (8, 29), (8, 19), (8, 28), (8, 14), (8, 33), (8, 9), (4, 10), (9, 10), (10, 11), (10, 15), (10, 16), (10, 17), (10, 20), (10, 22), (10, 23), (10, 18), (10, 24), (10, 26), (10, 30), (10, 13), (10, 21), (10, 29), (10, 32), (10, 19), (10, 27), (10, 28), (10, 14), (10, 33), (4, 11), (9, 11), (11, 15), (11, 16), (11, 17), (11, 20), (11, 22), (11, 23), (11, 25), (11, 18), (11, 24), (11, 26), (11, 30), (11, 13), (11, 21), (11, 32), (11, 27), (11, 28), (11, 14), (11, 12), (11, 33), (4, 15), (9, 15), (12, 15), (13, 15), (14, 15), (15, 16), (15, 17), (15, 20), (15, 22), (15, 23), (15, 25), (15, 18), (15, 24), (15, 26), (15, 30), (15, 21), (15, 29), (15, 32), (15, 19), (15, 27), (15, 31), (15, 33), (4, 16), (9, 16), (12, 16), (13, 16), (14, 16), (16, 17), (16, 20), (16, 22), (16, 23), (16, 25), (16, 18), (16, 24), (16, 30), (16, 21), (16, 32), (16, 19), (16, 27), (16, 31), (16, 33), (4, 17), (9, 17), (12, 17), (14, 17), (17, 20), (17, 23), (17, 25), (17, 18), (17, 24), (17, 30), (17, 19), (17, 27), (17, 31), (9, 20), (12, 20), (13, 20), (18, 20), (19, 20), (20, 25), (20, 24), (20, 30), (20, 21), (20, 29), (20, 27), (20, 28), (9, 22), (12, 22), (18, 22), (19, 22), (22, 32), (22, 28), (22, 33), (9, 23), (12, 23), (14, 23), (23, 26), (23, 29), (23, 31), (23, 33), (9, 25), (21, 25), (24, 25), (25, 32), (25, 33), (18, 19), (13, 26), (21, 27), (4, 21).
Question: What is the global efficiency of the graph?
You need to format your answer as a float number. | 0.7916666666666666 | graph_global_efficiency |
The task is to determine the local connectivity of two nodes in the graph.
Local connectivity is whether there exists at least one path between the two nodes.
Here is an undirected graph. In the graph, (u, v) means that node u and node v are connected. The graph contains nodes: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, and 18. The graph contains edges: (1, 11), (1, 9), (3, 11), (4, 11), (11, 18), (11, 12), (2, 10), (7, 10), (3, 18), (3, 4), (3, 17), (4, 18), (12, 18), (4, 17), (5, 6), (5, 8), (6, 16), (6, 8), (7, 16), (15, 16), (7, 13), (7, 14), (7, 15), (13, 14), (13, 15), (14, 15).
Question: What is the local connectivity between node 7 and node 1 in the graph?
| No | graph_local_connectivity |
The task is to determine the minimum vertex cover of a graph.
A vertex cover is a set of nodes such that every edge in the graph is incident to at least one node in the set.
Here is an undirected graph. In the graph, (u, v) means that node u and node v are connected. The graph contains nodes: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, and 24. The graph contains edges: (1, 14), (1, 4), (10, 14), (3, 4), (2, 15), (6, 15), (3, 12), (3, 9), (12, 24), (9, 19), (9, 11), (5, 13), (5, 21), (13, 22), (20, 21), (6, 7), (8, 23), (16, 23), (23, 24), (19, 20), (11, 18), (10, 16), (17, 18).
Question: What is the minimum vertex cover of the graph?
You need to format your answer as a list of nodes in ascending order, e.g., [node-1, node-2, ..., node-n]. | [1,2,3,5,6,8,9,10,11,12,13,15,16,18,19,20,23] | graph_min_vertex_cover |
The task is to determine the number of strongly connected components in a directed graph.
A strongly connected component is a maximal subgraph where every node is reachable from every other node.
Here is a directed graph. In the graph, (u, v) means that there is an edge from node u to node v. The graph contains nodes: 1, 2, 3, 4, 5, 6, and 7. The graph contains edges: (5, 1), (5, 3), (7, 6), (7, 4), (7, 2).
Question: How many strongly connected components are there in the graph?
| 7 | graph_strongly_connected_number |
The task is to determine the constraint of a node in a graph.
The constraint of a node is a measure of how much the node is constrained by its neighbors.
Here is an undirected graph. In the graph, (u, v) means that node u and node v are connected. The graph contains nodes: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, and 22. The graph contains edges: (1, 7), (1, 16), (1, 6), (1, 10), (1, 12), (1, 22), (1, 20), (1, 5), (1, 19), (5, 7), (6, 7), (7, 16), (7, 10), (7, 12), (7, 22), (7, 20), (7, 19), (5, 16), (6, 16), (10, 16), (12, 16), (16, 22), (16, 20), (16, 19), (5, 6), (6, 10), (6, 12), (6, 22), (6, 19), (5, 10), (10, 12), (10, 22), (10, 19), (5, 12), (12, 22), (12, 19), (5, 22), (19, 22), (17, 20), (5, 19), (2, 17), (2, 4), (2, 18), (2, 3), (2, 8), (8, 17), (3, 4), (4, 15), (4, 18), (4, 8), (3, 18), (8, 18), (15, 18), (3, 15), (3, 8), (9, 15), (11, 15), (13, 15), (9, 13), (9, 11), (11, 13), (14, 21).
Question: What is the constraint of node 8 in the graph?
You need to format your answer as a float number. | 0.5143111111111113 | graph_constraint |
The task is to determine the breadth-first search (BFS) traversal order given a starting node.
Here is an undirected graph. In the graph, (u, v) means that node u and node v are connected. The graph contains nodes: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, and 28. The graph contains edges: (1, 21), (1, 3), (8, 21), (16, 21), (3, 24), (3, 15), (3, 8), (2, 23), (2, 6), (2, 11), (13, 23), (23, 25), (6, 11), (10, 11), (18, 24), (24, 27), (10, 15), (8, 22), (4, 5), (5, 28), (12, 28), (16, 28), (7, 20), (7, 16), (12, 20), (9, 16), (13, 22), (9, 26), (10, 14), (12, 27), (18, 27), (13, 25), (17, 18), (17, 19).
Question: What is the breadth-first search (BFS) traversal order for the starting node 14?
You need to format your answer as a list of edges in ascending dictionary order, e.g., [(u1, v1), (u2, v2), ..., (un, vn)]. | [(14,10),(10,11),(10,15),(11,2),(11,6),(15,3),(2,23),(3,1),(3,8),(3,24),(23,13),(23,25),(1,21),(8,22),(24,18),(24,27),(21,16),(18,17),(27,12),(16,7),(16,9),(16,28),(17,19),(12,20),(9,26),(28,5),(5,4)] | graph_bfs |
The task is to determine the degree centrality of a node in the graph.
The degree centrality values are normalized by dividing by the maximum possible degree in a graph.
Here is an undirected graph. In the graph, (u, v) means that node u and node v are connected. The graph contains nodes: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, and 16. The graph contains edges: (1, 14), (1, 7), (2, 14), (12, 14), (14, 16), (7, 15), (2, 5), (3, 16), (3, 12), (6, 16), (4, 9), (4, 6), (4, 8), (9, 10), (9, 11), (8, 10), (10, 13), (11, 13).
Question: What is the degree centrality of node 13 in the graph?
You need to format your answer as a float number. | 0.13333333333333333 | graph_degree_centrality |
The task is to determine the local connectivity of two nodes in the graph.
Local connectivity is whether there exists at least one path between the two nodes.
Here is an undirected graph. In the graph, (u, v) means that node u and node v are connected. The graph contains nodes: 1, 2, 3, 4, 5, and 6. The graph contains edges: (1, 6), (3, 6), (2, 3), (2, 4), (2, 5), (3, 5), (4, 5).
Question: What is the local connectivity between node 4 and node 6 in the graph?
| Yes | graph_local_connectivity |
The task is to determine the Jaccard coefficient of two nodes in a graph.
The Jaccard coefficient is the size of the intersection divided by the size of the union of the neighbors of the two nodes.
Here is an undirected graph. In the graph, (u, v) means that node u and node v are connected. The graph contains nodes: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, and 19. The graph contains edges: (1, 2), (1, 3), (1, 9), (1, 8), (1, 10), (2, 3), (2, 4), (2, 5), (2, 6), (2, 7), (2, 8), (3, 5), (3, 6), (3, 7), (3, 8), (8, 9), (9, 16), (9, 17), (9, 10), (5, 8), (6, 8), (8, 10), (8, 18), (10, 17), (4, 6), (4, 7), (4, 11), (5, 6), (6, 7), (6, 11), (7, 11), (14, 18), (12, 16), (15, 16), (16, 17), (16, 19), (12, 17), (12, 13), (12, 15), (13, 14), (15, 19).
Question: What is the Jaccard coefficient between node 5 and node 10?
You need to format your answer as a float number. | 0.14285714285714285 | graph_jaccard_coefficient |
The task is to determine the Wiener index of a connected graph.
The Wiener index of a graph is the sum of the shortest-path distances between each pair of reachable nodes. For pairs of nodes in undirected graphs, only one orientation of the pair is counted.
Here is an undirected graph. In the graph, (u, v) means that node u and node v are connected. The graph contains nodes: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, and 21. The graph contains edges: (1, 2), (1, 4), (1, 5), (2, 4), (2, 3), (2, 6), (2, 7), (4, 5), (4, 7), (5, 8), (5, 9), (5, 11), (3, 21), (3, 6), (6, 13), (6, 21), (7, 12), (7, 13), (20, 21), (8, 9), (8, 11), (9, 10), (9, 11), (10, 11), (12, 13), (13, 17), (13, 20), (15, 17), (14, 15), (14, 16), (15, 16), (16, 18), (16, 19), (18, 19).
Question: What is the Wiener index of the graph?
You need to format your answer as a float number. | 767.0 | graph_wiener_index |
The task is to determine the density of the graph.
Density is defined as the ratio of the number of edges in the graph to the number of possible edges. For undirected graphs, the density is 2*m/(n*(n-1)), where m is the edge number and n is the node number. For directed graphs, the density is m/(n*(n-1)).
Here is an undirected graph. In the graph, (u, v) means that node u and node v are connected. The graph contains nodes: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, and 23. The graph contains edges: (1, 20), (1, 14), (6, 14), (2, 15), (8, 15), (3, 22), (12, 22), (4, 13), (4, 16), (13, 17), (16, 23), (16, 21), (5, 18), (5, 11), (10, 18), (6, 9), (9, 19), (7, 23), (7, 21), (8, 17), (10, 19).
Question: What is the density of the graph?
You need to format your answer as a float number. | 0.08300395256916997 | graph_density |
The task is to determine the minimum vertex cover of a graph.
A vertex cover is a set of nodes such that every edge in the graph is incident to at least one node in the set.
Here is an undirected graph. In the graph, (u, v) means that node u and node v are connected. The graph contains nodes: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, and 23. The graph contains edges: (1, 3), (1, 9), (3, 10), (9, 10), (9, 21), (2, 13), (2, 4), (11, 13), (10, 17), (10, 16), (5, 14), (5, 15), (7, 14), (15, 20), (15, 17), (6, 22), (6, 21), (8, 18), (8, 23), (12, 18), (11, 19), (11, 12), (12, 19).
Question: What is the minimum vertex cover of the graph?
You need to format your answer as a list of nodes in ascending order, e.g., [node-1, node-2, ..., node-n]. | [1,2,3,5,6,8,9,10,11,14,15,18,19] | graph_min_vertex_cover |
The task is to determine the number of nodes in the graph.
Here is an undirected graph. In the graph, (u, v) means that node u and node v are connected. The graph contains nodes: 1, 2, 3, 4, 5, 6, 7, 8, and 9. The graph contains edges: (1, 4), (1, 6), (1, 2), (1, 7), (1, 8), (1, 5), (1, 9), (1, 3), (2, 4), (3, 4), (4, 6), (4, 7), (4, 8), (4, 5), (2, 6), (3, 6), (5, 6), (6, 7), (6, 8), (6, 9), (2, 7), (2, 8), (2, 5), (2, 9), (2, 3), (3, 7), (5, 7), (7, 8), (7, 9).
Question: How many nodes are there in the graph?
| 9 | graph_node_number |
The task is to find the number of triangles that include a specific node as one vertex.
A triangle is a set of three nodes that are all connected to each other.
Here is an undirected graph. In the graph, (u, v) means that node u and node v are connected. The graph contains nodes: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, and 26. The graph contains edges: (1, 4), (1, 5), (1, 2), (1, 3), (4, 6), (4, 8), (4, 9), (2, 5), (3, 5), (5, 6), (2, 3), (3, 7), (7, 18), (8, 9), (8, 23), (8, 24), (8, 25), (8, 26), (9, 25), (9, 26), (23, 24), (23, 26), (24, 25), (24, 26), (25, 26), (10, 11), (10, 12), (10, 16), (10, 17), (11, 12), (11, 13), (11, 14), (12, 13), (16, 19), (16, 20), (17, 21), (17, 22), (13, 14), (15, 22), (21, 22), (19, 20).
Question: How many triangles include node 3 in the graph?
| 3 | graph_triangles |
The task is to determine the Wiener index of a connected graph.
The Wiener index of a graph is the sum of the shortest-path distances between each pair of reachable nodes. For pairs of nodes in undirected graphs, only one orientation of the pair is counted.
Here is an undirected graph. In the graph, (u, v) means that node u and node v are connected. The graph contains nodes: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, and 11. The graph contains edges: (1, 2), (2, 3), (2, 4), (2, 5), (2, 6), (3, 7), (3, 5), (3, 8), (3, 9), (4, 7), (4, 5), (5, 7), (5, 6), (5, 8), (7, 8), (8, 9), (8, 10), (10, 11).
Question: What is the Wiener index of the graph?
You need to format your answer as a float number. | 115.0 | graph_wiener_index |
The task is to determine the closeness centrality of a node in the graph.
For a node u, closeness centrality is the reciprocal of the average shortest path distance to u over all n-1 reachable nodes. For directed graphs, it computes the incoming distance to u.
Here is an undirected graph. In the graph, (u, v) means that node u and node v are connected. The graph contains nodes: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, and 19. The graph contains edges: (1, 17), (6, 17), (16, 17), (2, 15), (2, 6), (2, 8), (2, 13), (14, 15), (8, 10), (8, 9), (13, 16), (3, 4), (3, 18), (4, 7), (4, 12), (5, 18), (7, 10), (7, 9), (5, 11), (11, 14), (10, 19).
Question: What is the closeness centrality of node 14 in the graph?
You need to format your answer as a float number. | 0.28125 | graph_closeness_centrality |
The task is to determine the number of weakly connected components in a directed graph.
A weakly connected component is a maximal subgraph where every node is reachable from every other node when ignoring the direction of edges.
Here is a directed graph. In the graph, (u, v) means that there is an edge from node u to node v. The graph contains nodes: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, and 25. The graph contains edges: (1, 21), (2, 9), (3, 20), (3, 24), (20, 23), (20, 13), (24, 12), (4, 8), (5, 18), (18, 15), (18, 3), (7, 3), (7, 20), (7, 24), (11, 10), (14, 6), (15, 25), (15, 10), (17, 16), (19, 22).
Question: How many weakly connected components are there in the graph?
| 7 | graph_weakly_connected_number |
The task is to determine the number of nodes in the graph.
Here is an undirected graph. In the graph, (u, v) means that node u and node v are connected. The graph contains nodes: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, and 23. The graph contains edges: (1, 10), (1, 6), (1, 8), (1, 18), (5, 10), (9, 10), (10, 22), (2, 6), (6, 21), (6, 8), (6, 16), (3, 8), (5, 8), (8, 14), (8, 9), (8, 18), (8, 23), (2, 18), (3, 18), (5, 18), (7, 18), (9, 18), (11, 18), (12, 18), (13, 18), (14, 18), (15, 18), (16, 18), (17, 18), (18, 21), (18, 22), (2, 21), (2, 16), (7, 21), (15, 21), (16, 21), (21, 22), (21, 23), (5, 16), (16, 22), (3, 14), (3, 20), (3, 22), (3, 23), (9, 14), (4, 20), (11, 20), (20, 22), (11, 22), (12, 22), (5, 23), (9, 23), (12, 23), (15, 23), (4, 7), (5, 9), (9, 19), (11, 19), (12, 13), (13, 17).
Question: How many nodes are there in the graph?
| 23 | graph_node_number |
The task is to determine the minimum edge covering of a graph.
An edge cover is a set of edges such that every vertex in the graph is incident to at least one edge in the set. The minimum edge cover is the edge cover with the smallest number of edges.
Here is an undirected graph. In the graph, (u, v) means that node u and node v are connected. The graph contains nodes: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, and 34. The graph contains edges: (1, 12), (1, 32), (12, 19), (21, 32), (2, 15), (2, 14), (15, 30), (15, 17), (3, 21), (3, 25), (8, 21), (7, 25), (4, 10), (4, 20), (10, 16), (19, 20), (20, 33), (5, 31), (5, 22), (18, 31), (8, 22), (6, 8), (8, 24), (9, 33), (9, 11), (13, 33), (11, 29), (11, 26), (16, 23), (29, 34), (26, 28), (13, 27), (13, 28), (23, 30).
Question: What is the minimum edge covering of the graph?
You need to format your answer as a list of edges in ascending dictionary order, e.g., [(u1, v1), (u2, v2), ..., (un, vn)]. | [(7,25),(8,6),(10,4),(11,9),(13,27),(14,2),(16,10),(17,15),(18,31),(19,12),(21,3),(22,5),(23,30),(24,8),(28,26),(32,1),(33,20),(34,29)] | graph_min_edge_covering |
The task is to determine the number of isolated nodes in the graph.
An isolated node is a node that has no edges connecting it to any other nodes.
Here is an undirected graph. In the graph, (u, v) means that node u and node v are connected. The graph contains nodes: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, and 12. The graph contains edges: (1, 4), (3, 4), (2, 9), (8, 9), (3, 8), (5, 8), (6, 11), (6, 7), (10, 11), (10, 12).
Question: How many isolated nodes are there in the graph?
| 0 | graph_isolate_number |
The task is to determine the periphery of a graph.
The periphery of a graph is the set of nodes that are farthest from the center of the graph.
Here is an undirected graph. In the graph, (u, v) means that node u and node v are connected. The graph contains nodes: 1, 2, 3, 4, 5, 6, 7, 8, 9, and 10. The graph contains edges: (1, 2), (1, 3), (1, 4), (1, 5), (2, 3), (2, 4), (2, 5), (2, 6), (2, 7), (3, 5), (3, 6), (3, 10), (4, 5), (4, 7), (5, 9), (5, 7), (7, 9), (8, 9).
Question: What is the periphery of the graph?
You need to format your answer as a list of nodes in ascending order, e.g., [node-1, node-2, ..., node-n]. | [6,8,10] | graph_periphery |
Given two nodes u and v, the task is to determine the shortest path between u and v (for directed graph, from u to v).
Here is a directed graph. In the graph, (u, v) means that there is an edge from node u to node v. The graph contains nodes: 1, 2, 3, 4, 5, 6, and 7. The graph contains edges: (1, 6), (2, 3), (4, 7), (5, 4).
Question: What is the shortest path between node 5 and node 7?
You need to format your answer as a list of nodes, e.g., [node-1, node-2, ..., node-n]. | [5,4,7] | graph_shortest_path |
The task is to determine the resource allocation index of two nodes in a graph.
The resource allocation index of two nodes is the sum of the inverse of the degrees of the common neighbors of the two nodes.
Here is an undirected graph. In the graph, (u, v) means that node u and node v are connected. The graph contains nodes: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, and 12. The graph contains edges: (1, 7), (1, 9), (6, 9), (9, 10), (2, 8), (2, 4), (8, 12), (4, 5), (3, 12), (10, 11).
Question: What is the resource allocation index between node 1 and node 8?
You need to format your answer as a float number. | 0 | graph_resource_allocation_index |
The task is to determine the minimum spanning tree of a graph.
A minimum spanning tree is a subset of the edges that connects all vertices in the graph with the minimum possible total edge weight. If not specified, all edges have equal edge weights
Here is an undirected graph. In the graph, (u, v) means that node u and node v are connected. The graph contains nodes: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, and 26. The graph contains edges: (1, 2), (1, 5), (1, 6), (2, 5), (2, 6), (5, 6), (3, 20), (3, 4), (3, 23), (4, 22), (4, 23), (21, 23), (22, 23), (21, 22), (7, 11), (7, 12), (7, 13), (7, 14), (9, 11), (10, 11), (12, 13), (12, 15), (12, 16), (13, 14), (13, 15), (13, 16), (14, 17), (8, 24), (8, 17), (8, 26), (17, 24), (18, 24), (18, 26), (19, 26), (25, 26), (9, 10), (18, 25), (19, 25).
Question: What is the minimum spanning tree of the graph?
You need to format your answer as a list of edges in ascending dictionary order, e.g., [(u1, v1), (u2, v2), ..., (un, vn)]. | [(1,2),(1,5),(1,6),(3,4),(3,20),(3,23),(4,22),(7,11),(7,12),(7,13),(7,14),(8,17),(8,24),(8,26),(9,10),(9,11),(12,15),(12,16),(14,17),(18,24),(18,25),(19,25),(21,22)] | graph_minimum_spanning_tree |
Given two nodes u and v, the task is to determine the shortest path between u and v (for directed graph, from u to v).
Here is an undirected graph. In the graph, (u, v) means that node u and node v are connected. The graph contains nodes: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, and 34. The graph contains edges: (1, 33), (1, 18), (3, 33), (2, 22), (2, 21), (21, 22), (22, 30), (22, 31), (21, 30), (21, 31), (3, 7), (6, 7), (7, 11), (7, 9), (4, 14), (4, 32), (14, 24), (14, 26), (8, 32), (5, 25), (5, 10), (10, 25), (10, 29), (6, 9), (9, 11), (9, 19), (9, 20), (11, 19), (11, 20), (19, 20), (12, 24), (12, 13), (12, 34), (12, 28), (24, 26), (24, 28), (13, 34), (13, 28), (15, 23), (15, 30), (23, 27), (23, 30), (16, 30), (17, 30), (27, 30), (30, 31), (16, 27), (16, 17), (16, 31), (17, 27), (17, 31).
Question: What is the shortest path between node 18 and node 19?
You need to format your answer as a list of nodes, e.g., [node-1, node-2, ..., node-n]. | [18,1,33,3,7,11,19] | graph_shortest_path |
The task is to determine the Wiener index of a connected graph.
The Wiener index of a graph is the sum of the shortest-path distances between each pair of reachable nodes. For pairs of nodes in undirected graphs, only one orientation of the pair is counted.
Here is an undirected graph. In the graph, (u, v) means that node u and node v are connected. The graph contains nodes: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, and 15. The graph contains edges: (1, 11), (1, 7), (5, 11), (8, 11), (11, 12), (7, 10), (2, 12), (2, 13), (5, 12), (3, 4), (4, 15), (4, 9), (14, 15), (8, 9), (6, 8), (10, 14).
Question: What is the Wiener index of the graph?
You need to format your answer as a float number. | 343.0 | graph_wiener_index |
The task is to determine the Wiener index of a connected graph.
The Wiener index of a graph is the sum of the shortest-path distances between each pair of reachable nodes. For pairs of nodes in undirected graphs, only one orientation of the pair is counted.
Here is an undirected graph. In the graph, (u, v) means that node u and node v are connected. The graph contains nodes: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, and 18. The graph contains edges: (1, 15), (1, 18), (15, 17), (4, 18), (5, 18), (6, 18), (9, 18), (10, 18), (11, 18), (14, 18), (16, 18), (2, 10), (2, 12), (3, 10), (4, 10), (6, 10), (9, 12), (3, 7), (3, 6), (4, 7), (4, 6), (5, 14), (5, 13), (8, 14), (13, 14), (13, 16), (11, 17).
Question: What is the Wiener index of the graph?
You need to format your answer as a float number. | 374.0 | graph_wiener_index |
The task is to determine if the directed graph is strongly connected.
A directed graph is strongly connected if there is a directed path between every pair of vertices.
Here is a directed graph. In the graph, (u, v) means that there is an edge from node u to node v. The graph contains nodes: 1, 2, 3, 4, 5, and 6. The graph contains edges: (1, 3), (1, 2), (1, 6), (3, 5), (3, 1), (3, 2), (2, 3), (2, 1), (2, 4), (2, 6), (6, 1), (6, 2), (4, 2), (5, 3), (5, 1), (5, 2).
Question: Is the directed graph strongly connected?
Your answer should be Yes or No. | Yes | graph_is_strongly_connected |
The task is to determine the number of connected components in the graph.
A connected component is a subgraph where any two nodes are connected to each other by paths.
Here is an undirected graph. In the graph, (u, v) means that node u and node v are connected. The graph contains nodes: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, and 28. The graph contains edges: (1, 9), (1, 3), (6, 9), (7, 9), (3, 12), (2, 18), (2, 13), (14, 18), (13, 20), (8, 12), (12, 16), (4, 17), (4, 27), (17, 26), (10, 27), (5, 21), (5, 24), (19, 21), (16, 24), (24, 26), (6, 15), (6, 23), (6, 25), (15, 22), (7, 23), (20, 25), (7, 26), (10, 16), (11, 19), (14, 28).
Question: How many connected components are there in the graph?
| 1 | graph_connected_component_number |
The task is to determine the minimum vertex cover of a graph.
A vertex cover is a set of nodes such that every edge in the graph is incident to at least one node in the set.
Here is an undirected graph. In the graph, (u, v) means that node u and node v are connected. The graph contains nodes: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, and 26. The graph contains edges: (1, 2), (1, 3), (1, 5), (1, 6), (1, 7), (2, 3), (2, 4), (2, 5), (2, 6), (2, 7), (3, 4), (3, 7), (3, 8), (5, 6), (5, 10), (6, 7), (6, 10), (6, 11), (4, 7), (4, 9), (4, 8), (8, 9), (8, 13), (8, 14), (8, 15), (8, 16), (9, 13), (9, 14), (9, 15), (10, 25), (10, 26), (10, 11), (11, 25), (11, 26), (13, 14), (13, 17), (14, 17), (15, 16), (23, 25), (24, 25), (25, 26), (23, 26), (24, 26), (12, 19), (12, 22), (18, 19), (19, 20), (19, 22), (18, 22), (20, 22), (20, 21), (23, 24).
Question: What is the minimum vertex cover of the graph?
You need to format your answer as a list of nodes in ascending order, e.g., [node-1, node-2, ..., node-n]. | [1,2,3,4,5,6,8,9,10,11,12,13,14,15,18,19,20,23,25,26] | graph_min_vertex_cover |
The task is to determine the betweenness centrality of a node in the graph.
Betweenness centrality of a node u is the sum of the fraction of all-pairs shortest paths that pass through u.
Here is an undirected graph. In the graph, (u, v) means that node u and node v are connected. The graph contains nodes: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, and 25. The graph contains edges: (1, 10), (2, 10), (8, 10), (9, 10), (2, 7), (7, 8), (3, 20), (18, 20), (19, 20), (4, 6), (4, 5), (4, 25), (5, 24), (22, 24), (8, 11), (9, 11), (12, 13), (14, 17), (14, 16), (17, 19), (16, 19), (16, 18), (15, 18), (21, 23), (22, 23).
Question: What is the betweenness centrality of node 6 in the graph?
You need to format your answer as a float number. | 0.0 | graph_betweenness_centrality |
The task is to determine the minimum spanning tree of a graph.
A minimum spanning tree is a subset of the edges that connects all vertices in the graph with the minimum possible total edge weight. If not specified, all edges have equal edge weights
Here is an undirected graph. In the graph, (u, v) means that node u and node v are connected. The graph contains nodes: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, and 16. The graph contains edges: (1, 8), (1, 15), (1, 14), (1, 6), (1, 7), (1, 16), (6, 8), (7, 8), (8, 15), (8, 14), (6, 15), (7, 15), (14, 15), (15, 16), (6, 14), (7, 14), (2, 6), (6, 12), (6, 7), (6, 16), (2, 7), (7, 12), (7, 16), (2, 16), (3, 9), (3, 10), (3, 13), (4, 9), (10, 13), (4, 13), (11, 13), (4, 11), (5, 12).
Question: What is the minimum spanning tree of the graph?
You need to format your answer as a list of edges in ascending dictionary order, e.g., [(u1, v1), (u2, v2), ..., (un, vn)]. | [(1,6),(1,7),(1,8),(1,14),(1,15),(1,16),(2,6),(3,9),(3,10),(3,13),(4,9),(4,11),(5,12),(6,12)] | graph_minimum_spanning_tree |
The task is to determine the constraint of a node in a graph.
The constraint of a node is a measure of how much the node is constrained by its neighbors.
Here is an undirected graph. In the graph, (u, v) means that node u and node v are connected. The graph contains nodes: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, and 12. The graph contains edges: (1, 6), (1, 10), (1, 2), (1, 5), (1, 8), (1, 9), (1, 12), (1, 4), (1, 11), (2, 6), (4, 6), (5, 6), (6, 10), (6, 8), (6, 9), (6, 12), (6, 11), (6, 7), (2, 10), (3, 10), (5, 10), (7, 10), (8, 10), (9, 10), (10, 11), (2, 5), (2, 8), (2, 9), (2, 12), (2, 4), (2, 3), (2, 11), (2, 7), (3, 5), (4, 5), (5, 8), (5, 9), (5, 12), (5, 7), (3, 8), (4, 8), (7, 8), (8, 9), (8, 12), (8, 11), (3, 9).
Question: What is the constraint of node 10 in the graph?
You need to format your answer as a float number. | 0.35080770060407707 | graph_constraint |
The task is to determine if the graph is bipartite.
A bipartite graph is a graph whose nodes can be divided into two disjoint sets such that no two graph vertices within the same set are adjacent.
Here is a directed graph. In the graph, (u, v) means that there is an edge from node u to node v. The graph contains nodes: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, and 15. The graph contains edges: (1, 2), (1, 3), (1, 5), (2, 7), (2, 10), (2, 1), (3, 7), (3, 10), (3, 1), (5, 10), (5, 9), (5, 1), (7, 2), (7, 3), (10, 2), (10, 3), (10, 12), (10, 5), (4, 14), (14, 4), (14, 15), (9, 11), (9, 5), (6, 15), (6, 13), (15, 6), (15, 14), (13, 6), (8, 12), (12, 8), (12, 10), (11, 9).
Question: Is the graph bipartite?
Your answer should be Yes or No. | Yes | graph_is_bipartite |
The task is to find the number of triangles that include a specific node as one vertex.
A triangle is a set of three nodes that are all connected to each other.
Here is an undirected graph. In the graph, (u, v) means that node u and node v are connected. The graph contains nodes: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, and 17. The graph contains edges: (1, 4), (1, 16), (1, 5), (1, 3), (1, 11), (1, 2), (2, 4), (3, 4), (4, 16), (4, 5), (4, 11), (2, 16), (3, 16), (5, 16), (2, 5), (3, 5), (5, 11), (2, 3), (3, 11), (2, 11), (6, 15), (6, 10), (6, 7), (6, 8), (6, 9), (7, 15), (8, 15), (9, 15), (10, 15), (7, 10), (8, 10), (10, 17), (7, 8), (7, 9), (8, 9), (12, 17), (13, 14).
Question: How many triangles include node 10 in the graph?
| 6 | graph_triangles |
The task is to determine the average degree of the neighbors of a node in the graph.
Here is an undirected graph. In the graph, (u, v) means that node u and node v are connected. The graph contains nodes: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, and 34. The graph contains edges: (1, 3), (1, 4), (1, 5), (1, 6), (3, 33), (3, 4), (4, 5), (4, 6), (5, 28), (5, 27), (5, 6), (6, 28), (2, 18), (2, 23), (10, 18), (13, 18), (17, 18), (18, 23), (10, 23), (24, 28), (27, 28), (24, 27), (25, 27), (7, 34), (7, 31), (22, 34), (31, 32), (8, 29), (8, 30), (9, 29), (11, 29), (29, 30), (9, 30), (11, 30), (9, 11), (9, 12), (11, 12), (13, 14), (13, 15), (13, 17), (14, 15), (14, 17), (15, 17), (16, 26), (19, 20), (20, 22), (20, 21), (21, 22), (24, 25).
Question: What is the average neighbor degree of node 34 in the graph?
You need to format your answer as a float number. | 2.5 | graph_avg_neighbor_degree |
The task is to determine the number of nodes in the graph.
Here is an undirected graph. In the graph, (u, v) means that node u and node v are connected. The graph contains nodes: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, and 18. The graph contains edges: (1, 2), (1, 6), (1, 7), (1, 4), (1, 5), (2, 3), (2, 4), (2, 5), (4, 6), (6, 13), (6, 7), (6, 14), (4, 7), (7, 14), (4, 12), (4, 13), (4, 14), (3, 5), (5, 18), (5, 8), (5, 9), (3, 9), (8, 9), (9, 17), (9, 18), (9, 16), (11, 12), (12, 13), (12, 14), (11, 13), (13, 14), (11, 14), (8, 17), (8, 16), (15, 17), (16, 17), (10, 15).
Question: How many nodes are there in the graph?
| 18 | graph_node_number |
The task is to determine the degree centrality of a node in the graph.
The degree centrality values are normalized by dividing by the maximum possible degree in a graph.
Here is an undirected graph. In the graph, (u, v) means that node u and node v are connected. The graph contains nodes: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, and 32. The graph contains edges: (1, 11), (1, 17), (11, 31), (17, 20), (2, 31), (2, 3), (18, 31), (3, 5), (4, 5), (4, 29), (6, 32), (6, 27), (26, 32), (16, 27), (7, 8), (7, 13), (8, 25), (10, 13), (9, 12), (12, 19), (10, 15), (14, 15), (19, 24), (14, 23), (23, 30), (18, 26), (21, 26), (22, 26), (28, 30).
Question: What is the degree centrality of node 30 in the graph?
You need to format your answer as a float number. | 0.06451612903225806 | graph_degree_centrality |
The task is to determine the neighbors of a node in the graph.
Here is an undirected graph. In the graph, (u, v) means that node u and node v are connected. The graph contains nodes: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, and 16. The graph contains edges: (1, 16), (1, 2), (11, 16), (14, 16), (2, 6), (2, 10), (6, 10), (3, 11), (4, 9), (4, 8), (4, 5), (5, 9), (8, 9), (5, 8), (8, 12), (7, 12), (7, 13), (12, 15).
Question: What are the neighbors of node 3 in the graph?
You need to format your answer as a list of nodes in ascending order, e.g., [node-1, node-2, ..., node-n]. | [11] | graph_neighbor |
The task is to determine the number of connected components in the graph.
A connected component is a subgraph where any two nodes are connected to each other by paths.
Here is an undirected graph. In the graph, (u, v) means that node u and node v are connected. The graph contains nodes: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, and 11. The graph contains edges: (1, 2), (1, 3), (2, 5), (3, 4), (3, 9), (3, 6), (5, 9), (4, 8), (6, 8), (7, 10), (10, 11).
Question: How many connected components are there in the graph?
| 3 | graph_connected_component_number |
The task is to determine the degree centrality of a node in the graph.
The degree centrality values are normalized by dividing by the maximum possible degree in a graph.
Here is an undirected graph. In the graph, (u, v) means that node u and node v are connected. The graph contains nodes: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, and 15. The graph contains edges: (1, 9), (1, 12), (1, 5), (1, 15), (9, 10), (9, 11), (9, 12), (9, 15), (5, 12), (10, 12), (12, 15), (14, 15), (2, 3), (3, 6), (4, 6), (6, 13), (6, 14), (4, 13), (4, 14), (13, 14), (7, 8), (10, 11).
Question: What is the degree centrality of node 9 in the graph?
You need to format your answer as a float number. | 0.3571428571428571 | graph_degree_centrality |
Given nodes u and v in a graph, the task is to determine if there is an edge connecting the two nodes.
For undirected graphs, it means whether there are edges between u and v. For directed graphs, it means whether there are edges from u to v.Here is an undirected graph. In the graph, (u, v) means that node u and node v are connected. The graph contains nodes: 1, 2, 3, 4, 5, 6, 7, 8, 9, and 10. The graph contains edges: (1, 6), (1, 2), (6, 8), (2, 5), (5, 7), (3, 4), (3, 10), (4, 8), (9, 10).
Question: Is there an edge between node 5 and node 10?
Your answer should be Yes or No. | No | graph_edge_existence |
The task is to determine the minimum edge covering of a graph.
An edge cover is a set of edges such that every vertex in the graph is incident to at least one edge in the set. The minimum edge cover is the edge cover with the smallest number of edges.
Here is an undirected graph. In the graph, (u, v) means that node u and node v are connected. The graph contains nodes: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, and 11. The graph contains edges: (1, 5), (1, 6), (3, 5), (4, 5), (5, 11), (5, 10), (3, 6), (4, 6), (6, 11), (6, 10), (2, 8), (8, 9), (3, 7), (7, 10).
Question: What is the minimum edge covering of the graph?
You need to format your answer as a list of edges in ascending dictionary order, e.g., [(u1, v1), (u2, v2), ..., (un, vn)]. | [(5,1),(5,3),(5,4),(8,2),(9,8),(10,7),(11,6)] | graph_min_edge_covering |
The task is to determine the number of weakly connected components in a directed graph.
A weakly connected component is a maximal subgraph where every node is reachable from every other node when ignoring the direction of edges.
Here is a directed graph. In the graph, (u, v) means that there is an edge from node u to node v. The graph contains nodes: 1, 2, 3, 4, 5, 6, 7, and 8. The graph contains edges: (1, 4), (4, 5), (2, 6), (3, 7), (7, 8).
Question: How many weakly connected components are there in the graph?
| 3 | graph_weakly_connected_number |
The task is to determine if the directed graph is strongly connected.
A directed graph is strongly connected if there is a directed path between every pair of vertices.
Here is a directed graph. In the graph, (u, v) means that there is an edge from node u to node v. The graph contains nodes: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, and 17. The graph contains edges: (2, 16), (3, 4), (6, 13), (13, 17), (7, 5), (7, 14), (14, 7), (8, 6), (9, 15), (15, 9), (15, 1), (15, 4), (10, 14), (11, 12), (12, 2), (17, 11).
Question: Is the directed graph strongly connected?
Your answer should be Yes or No. | No | graph_is_strongly_connected |
The task is to determine the constraint of a node in a graph.
The constraint of a node is a measure of how much the node is constrained by its neighbors.
Here is an undirected graph. In the graph, (u, v) means that node u and node v are connected. The graph contains nodes: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, and 33. The graph contains edges: (1, 2), (1, 3), (1, 4), (2, 3), (2, 4), (3, 4), (4, 7), (7, 31), (7, 32), (5, 24), (5, 28), (24, 25), (24, 26), (24, 33), (24, 27), (6, 28), (6, 30), (31, 32), (8, 9), (8, 12), (8, 13), (8, 14), (8, 15), (8, 16), (8, 17), (9, 10), (9, 11), (10, 12), (12, 18), (12, 19), (11, 13), (13, 15), (13, 18), (14, 17), (14, 20), (14, 21), (11, 15), (15, 16), (15, 22), (15, 23), (16, 17), (16, 22), (10, 20), (10, 18), (10, 19), (11, 18), (20, 21), (18, 19), (22, 23), (22, 29), (23, 29), (25, 26), (26, 33), (26, 27), (27, 33).
Question: What is the constraint of node 27 in the graph?
You need to format your answer as a float number. | 0.7733950617283949 | graph_constraint |
The task is to determine the degree assortativity coefficient of a graph.
The degree assortativity coefficient is a measure of the correlation between the degrees of connected nodes.
Here is an undirected graph. In the graph, (u, v) means that node u and node v are connected. The graph contains nodes: 1, 2, 3, 4, and 5. The graph contains edges: (1, 5), (2, 5), (3, 5), (3, 4).
Question: What is the degree assortativity of the graph?
You need to format your answer as a float number. | -0.6666666666666666 | graph_degree_assortativity |
The task is to determine the topological sort of a directed acyclic graph (DAG).
Here is a directed graph. In the graph, (u, v) means that there is an edge from node u to node v. The graph contains nodes: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, and 19. The graph contains edges: (1, 5), (1, 6), (5, 14), (5, 17), (6, 14), (6, 17), (2, 6), (2, 10), (10, 16), (10, 14), (3, 8), (8, 4), (8, 7), (8, 13), (4, 9), (4, 11), (9, 11), (14, 7), (14, 9), (7, 4), (7, 18), (13, 4), (13, 7), (13, 9), (16, 5), (16, 6), (12, 19), (19, 16), (19, 14), (19, 1), (19, 2), (15, 3).
Question: What is the topological sort of the directed acyclic graph (DAG)?
You need to format your answer as a list of nodes, e.g., [node-1, node-2, ..., node-n]. | [12,15,19,3,1,2,8,10,13,16,5,6,14,17,7,4,18,9,11] | graph_topological_sort |
The task is to determine the maximal independent set guaranteed to contain a given node in the graph.
An independent set is a set of nodes such that the subgraph induced by these nodes contains no edges. A maximal independent set is an independent set such that it is not possible to add a new node and still get an independent set.
Here is an undirected graph. In the graph, (u, v) means that node u and node v are connected. The graph contains nodes: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, and 24. The graph contains edges: (1, 14), (1, 2), (1, 3), (1, 22), (2, 14), (3, 14), (12, 14), (2, 3), (2, 5), (3, 5), (5, 22), (13, 22), (5, 13), (4, 19), (4, 20), (4, 6), (4, 24), (6, 19), (19, 20), (6, 20), (6, 24), (21, 24), (7, 10), (7, 11), (7, 23), (8, 10), (10, 17), (10, 11), (10, 23), (8, 11), (11, 17), (11, 23), (8, 17), (9, 18), (15, 21), (15, 16), (16, 21).
Question: What is the maximal independent set that includes node 16 of the graph?
You need to format your answer as a list of nodes in ascending order, e.g., [node-1, node-2, ..., node-n]. | [3,11,12,13,16,18,20,24] | graph_maximal_independent_set |
The task is to determine the minimum vertex cover of a graph.
A vertex cover is a set of nodes such that every edge in the graph is incident to at least one node in the set.
Here is an undirected graph. In the graph, (u, v) means that node u and node v are connected. The graph contains nodes: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, and 34. The graph contains edges: (1, 2), (1, 5), (1, 6), (1, 4), (2, 3), (2, 4), (4, 5), (5, 32), (5, 6), (5, 33), (4, 6), (6, 22), (6, 33), (4, 31), (4, 32), (4, 33), (3, 7), (7, 8), (7, 30), (7, 11), (7, 15), (31, 32), (31, 33), (32, 33), (20, 22), (21, 22), (22, 23), (8, 9), (8, 14), (8, 15), (14, 30), (19, 30), (11, 34), (11, 15), (9, 10), (9, 14), (10, 16), (16, 17), (16, 18), (13, 34), (12, 13), (17, 18), (18, 19), (20, 21), (21, 23), (21, 24), (21, 25), (23, 24), (23, 25), (23, 26), (24, 25), (24, 27), (24, 28), (24, 26), (25, 26), (27, 29), (27, 28), (28, 29).
Question: What is the minimum vertex cover of the graph?
You need to format your answer as a list of nodes in ascending order, e.g., [node-1, node-2, ..., node-n]. | [1,2,3,4,5,6,7,8,9,10,11,12,13,14,16,17,18,20,21,22,23,24,25,27,29,30,31,32] | graph_min_vertex_cover |
The task is to determine the degree assortativity coefficient of a graph.
The degree assortativity coefficient is a measure of the correlation between the degrees of connected nodes.
Here is an undirected graph. In the graph, (u, v) means that node u and node v are connected. The graph contains nodes: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, and 14. The graph contains edges: (1, 3), (1, 8), (3, 6), (8, 10), (2, 5), (2, 13), (5, 12), (6, 14), (4, 9), (7, 9), (10, 12), (11, 14), (7, 11).
Question: What is the degree assortativity of the graph?
You need to format your answer as a float number. | -0.08333333333334075 | graph_degree_assortativity |
The task is to determine if the graph has a cycle.
Here is an undirected graph. In the graph, (u, v) means that node u and node v are connected. The graph contains nodes: 1, 2, 3, 4, and 5. The graph contains edges: (1, 3), (1, 2), (2, 4), (4, 5).
Question: Does the graph have a cycle?
Your answer should be Yes or No. | No | graph_has_cycle |
The task is to determine common neighbors between two nodes in the graph.
Here is an undirected graph. In the graph, (u, v) means that node u and node v are connected. The graph contains nodes: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, and 24. The graph contains edges: (1, 10), (1, 14), (1, 17), (1, 18), (1, 19), (1, 20), (1, 21), (1, 23), (1, 24), (1, 3), (1, 4), (1, 6), (1, 12), (1, 13), (1, 15), (3, 10), (10, 19), (10, 20), (10, 23), (10, 12), (10, 15), (2, 14), (3, 14), (4, 14), (5, 14), (6, 14), (8, 14), (11, 14), (13, 14), (14, 17), (14, 18), (14, 19), (14, 20), (14, 21), (14, 22), (14, 24), (14, 16), (2, 17), (3, 17), (4, 17), (5, 17), (6, 17), (8, 17), (11, 17), (13, 17), (16, 17), (17, 18), (17, 19), (17, 20), (17, 21), (17, 22), (17, 24), (2, 18), (3, 18), (4, 18), (5, 18), (6, 18), (8, 18), (11, 18), (13, 18), (16, 18), (18, 19), (18, 20), (18, 21), (18, 22), (18, 24), (3, 19), (4, 19), (6, 19), (12, 19), (13, 19), (15, 19), (19, 20), (19, 21), (19, 23), (19, 24), (3, 20), (4, 20), (6, 20), (12, 20), (13, 20), (15, 20), (20, 21), (20, 23), (20, 24), (2, 21), (3, 21), (4, 21), (5, 21), (6, 21), (8, 21), (11, 21), (13, 21), (16, 21), (21, 22), (21, 24), (3, 23), (12, 23), (15, 23), (2, 24), (3, 24), (4, 24), (5, 24), (6, 24), (8, 24), (11, 24), (13, 24), (16, 24), (22, 24), (3, 4), (3, 6), (3, 12), (3, 13), (3, 15), (2, 4), (4, 11), (4, 22), (4, 5), (4, 6), (4, 8), (4, 13), (4, 16), (2, 6), (5, 6), (6, 11), (6, 22), (6, 8), (6, 13), (6, 16), (12, 15), (2, 13), (5, 13), (8, 13), (11, 13), (13, 22), (13, 16), (2, 11), (2, 22), (2, 5), (2, 7), (2, 8), (2, 9), (2, 16), (5, 11), (7, 11), (8, 11), (9, 11), (11, 22), (11, 16), (5, 22), (7, 22), (8, 22), (9, 22), (16, 22), (5, 7), (5, 8), (5, 9), (5, 16), (7, 8), (7, 9), (7, 16), (8, 9), (8, 16), (9, 16).
Question: What are the common neighbors between node 24 and node 6?
You need to format your answer as a list of nodes in ascending order, e.g., [node-1, node-2, ..., node-n]. | [1,2,3,4,5,8,11,13,14,16,17,18,19,20,21,22] | graph_common_neighbor |
The task is to determine the resource allocation index of two nodes in a graph.
The resource allocation index of two nodes is the sum of the inverse of the degrees of the common neighbors of the two nodes.
Here is an undirected graph. In the graph, (u, v) means that node u and node v are connected. The graph contains nodes: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, and 24. The graph contains edges: (1, 3), (1, 7), (1, 9), (1, 10), (1, 16), (1, 17), (1, 18), (1, 19), (1, 20), (1, 21), (1, 22), (1, 23), (1, 24), (1, 2), (1, 6), (1, 5), (1, 12), (2, 3), (3, 7), (3, 9), (3, 10), (3, 16), (3, 17), (3, 18), (3, 19), (3, 20), (3, 21), (3, 22), (3, 23), (3, 24), (3, 6), (3, 5), (3, 12), (2, 7), (5, 7), (6, 7), (7, 9), (7, 10), (7, 16), (7, 17), (7, 18), (7, 19), (7, 20), (7, 21), (7, 22), (7, 23), (7, 24), (7, 12), (2, 9), (5, 9), (6, 9), (9, 10), (9, 16), (9, 17), (9, 18), (9, 19), (9, 20), (9, 21), (9, 22), (9, 23), (9, 24), (9, 12), (2, 10), (4, 10), (6, 10), (8, 10), (10, 13), (10, 14), (10, 16), (10, 17), (10, 19), (10, 20), (10, 21), (10, 22), (10, 23), (10, 11), (10, 12), (10, 15), (2, 16), (4, 16), (6, 16), (8, 16), (11, 16), (12, 16), (13, 16), (14, 16), (15, 16), (16, 17), (16, 19), (16, 20), (16, 21), (16, 22), (16, 23), (2, 17), (4, 17), (6, 17), (8, 17), (11, 17), (12, 17), (13, 17), (14, 17), (15, 17), (17, 19), (17, 20), (17, 21), (17, 22), (17, 23), (5, 18), (6, 18), (18, 20), (18, 22), (18, 24), (2, 19), (4, 19), (6, 19), (8, 19), (11, 19), (12, 19), (13, 19), (14, 19), (15, 19), (19, 20), (19, 21), (19, 22), (19, 23), (2, 20), (5, 20), (6, 20), (12, 20), (20, 21), (20, 22), (20, 23), (20, 24), (2, 21), (4, 21), (6, 21), (8, 21), (11, 21), (12, 21), (13, 21), (14, 21), (15, 21), (21, 22), (21, 23), (2, 22), (5, 22), (6, 22), (12, 22), (22, 23), (22, 24), (2, 23), (4, 23), (6, 23), (8, 23), (11, 23), (12, 23), (13, 23), (14, 23), (15, 23), (5, 24), (6, 24), (2, 4), (2, 13), (2, 14), (2, 6), (2, 8), (2, 11), (2, 12), (2, 15), (5, 6), (6, 12), (4, 12), (8, 12), (11, 12), (12, 13), (12, 14), (12, 15), (4, 13), (4, 14), (4, 8), (4, 11), (4, 15), (8, 13), (11, 13), (13, 14), (13, 15), (8, 14), (11, 14), (14, 15), (8, 11), (8, 15), (11, 15).
Question: What is the resource allocation index between node 4 and node 19?
You need to format your answer as a float number. | 0.7346153846153848 | graph_resource_allocation_index |
The task is to determine the closeness centrality of a node in the graph.
For a node u, closeness centrality is the reciprocal of the average shortest path distance to u over all n-1 reachable nodes. For directed graphs, it computes the incoming distance to u.
Here is an undirected graph. In the graph, (u, v) means that node u and node v are connected. The graph contains nodes: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, and 29. The graph contains edges: (1, 12), (3, 12), (6, 12), (12, 22), (12, 25), (12, 19), (2, 11), (2, 29), (2, 13), (2, 25), (11, 16), (4, 9), (4, 8), (9, 24), (8, 23), (5, 10), (5, 7), (5, 20), (20, 27), (16, 23), (17, 23), (24, 26), (16, 21), (14, 27), (27, 28), (15, 26), (18, 21).
Question: What is the closeness centrality of node 24 in the graph?
You need to format your answer as a float number. | 0.11931818181818182 | graph_closeness_centrality |
The task is to determine the harmonic centrality of a node in the graph.
Harmonic centrality of a node u is the sum of the reciprocal of the shortest path distances from all other nodes to u (direction is not considered for undirected graphs).
Here is an undirected graph. In the graph, (u, v) means that node u and node v are connected. The graph contains nodes: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, and 25. The graph contains edges: (1, 10), (1, 2), (5, 10), (8, 10), (2, 7), (7, 9), (3, 11), (3, 12), (11, 12), (11, 16), (12, 16), (12, 20), (4, 14), (4, 21), (14, 16), (5, 8), (6, 16), (6, 20), (16, 20), (13, 19), (13, 22), (13, 17), (13, 18), (17, 19), (18, 19), (19, 24), (19, 22), (17, 22), (18, 22), (22, 23), (17, 23), (17, 18), (15, 23), (24, 25).
Question: What is the harmonic centrality of node 22 in the graph?
You need to format your answer as a float number. | 6.333333333333333 | graph_harmonic_centrality |
The task is to determine if the graph has a cycle.
Here is an undirected graph. In the graph, (u, v) means that node u and node v are connected. The graph contains nodes: 1, 2, 3, 4, 5, 6, 7, 8, 9, and 10. The graph contains edges: (1, 10), (3, 10), (6, 10), (2, 4), (2, 5), (3, 7), (7, 8), (7, 9).
Question: Does the graph have a cycle?
Your answer should be Yes or No. | No | graph_has_cycle |
Given two nodes u and v, the task is to determine the shortest path between u and v (for directed graph, from u to v).
Here is an undirected graph. In the graph, (u, v) means that node u and node v are connected. The graph contains nodes: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, and 25. The graph contains edges: (1, 2), (1, 3), (1, 5), (1, 6), (1, 7), (1, 8), (2, 3), (2, 4), (2, 5), (2, 6), (2, 7), (3, 4), (3, 7), (3, 9), (3, 10), (5, 6), (5, 12), (6, 7), (6, 12), (6, 13), (4, 7), (8, 23), (8, 24), (8, 25), (4, 9), (4, 11), (4, 10), (9, 11), (9, 10), (9, 14), (10, 11), (10, 14), (11, 14), (12, 20), (12, 22), (12, 18), (12, 19), (12, 13), (13, 18), (13, 19), (24, 25), (20, 21), (20, 22), (21, 22), (16, 18), (17, 18), (18, 19), (16, 19), (17, 19), (15, 16), (15, 17), (16, 17).
Question: What is the shortest path between node 14 and node 15?
You need to format your answer as a list of nodes, e.g., [node-1, node-2, ..., node-n]. | [14,9,3,1,5,12,18,16,15] | graph_shortest_path |
The task is to determine the Adamic-Adar index of two nodes in a graph.
The Adamic-Adar index is the sum of the inverse logarithm of the degrees of the common neighbors of the two nodes.
Here is an undirected graph. In the graph, (u, v) means that node u and node v are connected. The graph contains nodes: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, and 28. The graph contains edges: (1, 9), (9, 24), (2, 5), (2, 6), (5, 13), (5, 12), (6, 19), (3, 21), (3, 20), (12, 21), (19, 21), (14, 20), (4, 16), (4, 8), (11, 16), (7, 8), (13, 18), (13, 15), (12, 25), (19, 27), (7, 17), (17, 18), (24, 27), (10, 26), (26, 28), (25, 28), (18, 22), (14, 23).
Question: What is the Adamic-Adar index between node 5 and node 26?
You need to format your answer as a float number. | 0 | graph_adamic_adar_index |
The task is to determine the effective size of a node in a graph.
The effective size of a node is the number of nodes that are not directly connected to it, but are connected to its neighbors.
Here is an undirected graph. In the graph, (u, v) means that node u and node v are connected. The graph contains nodes: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, and 17. The graph contains edges: (1, 12), (1, 6), (1, 7), (1, 13), (6, 12), (3, 6), (4, 6), (6, 17), (6, 11), (6, 14), (6, 16), (3, 7), (4, 7), (7, 17), (7, 14), (7, 9), (2, 4), (2, 3), (2, 17), (2, 14), (2, 9), (3, 4), (4, 11), (4, 5), (4, 8), (3, 5), (3, 15), (3, 11), (3, 8), (5, 17), (9, 11), (9, 16), (10, 11).
Question: What is the effective size of node 12 in the graph?
You need to format your answer as a float number. | 1.0 | graph_effective_size |
The task is to determine the minimum spanning tree of a graph.
A minimum spanning tree is a subset of the edges that connects all vertices in the graph with the minimum possible total edge weight. If not specified, all edges have equal edge weights
Here is an undirected graph. In the graph, (u, v) means that node u and node v are connected. The graph contains nodes: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, and 22. The graph contains edges: (1, 22), (1, 10), (1, 2), (10, 22), (3, 10), (8, 10), (2, 3), (3, 20), (3, 14), (4, 20), (18, 20), (4, 14), (5, 19), (17, 19), (6, 7), (8, 9), (11, 21), (11, 16), (13, 21), (16, 17), (12, 15), (15, 18).
Question: What is the minimum spanning tree of the graph?
You need to format your answer as a list of edges in ascending dictionary order, e.g., [(u1, v1), (u2, v2), ..., (un, vn)]. | [(1,2),(1,10),(1,22),(2,3),(3,14),(3,20),(4,20),(5,19),(6,7),(8,9),(8,10),(11,16),(11,21),(12,15),(13,21),(15,18),(16,17),(17,19),(18,20)] | graph_minimum_spanning_tree |
The task is to determine if the graph has a cycle.
Here is an undirected graph. In the graph, (u, v) means that node u and node v are connected. The graph contains nodes: 1, 2, 3, 4, 5, and 6. The graph contains edges: (1, 6), (1, 2), (4, 6), (2, 3), (4, 5).
Question: Does the graph have a cycle?
Your answer should be Yes or No. | No | graph_has_cycle |
The task is to determine the local connectivity of two nodes in the graph.
Local connectivity is whether there exists at least one path between the two nodes.
Here is an undirected graph. In the graph, (u, v) means that node u and node v are connected. The graph contains nodes: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, and 19. The graph contains edges: (1, 2), (1, 3), (1, 4), (2, 3), (2, 4), (3, 5), (3, 6), (3, 7), (4, 9), (4, 10), (4, 11), (5, 8), (5, 6), (5, 12), (6, 8), (6, 12), (7, 17), (7, 16), (9, 14), (9, 15), (9, 10), (9, 11), (10, 14), (10, 15), (10, 11), (11, 14), (11, 15), (8, 12), (16, 17), (17, 18), (17, 19), (16, 19), (13, 14), (14, 15), (13, 15), (18, 19).
Question: What is the local connectivity between node 7 and node 8 in the graph?
| Yes | graph_local_connectivity |
The task is to determine the density of the graph.
Density is defined as the ratio of the number of edges in the graph to the number of possible edges. For undirected graphs, the density is 2*m/(n*(n-1)), where m is the edge number and n is the node number. For directed graphs, the density is m/(n*(n-1)).
Here is an undirected graph. In the graph, (u, v) means that node u and node v are connected. The graph contains nodes: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, and 11. The graph contains edges: (1, 2), (1, 5), (1, 4), (2, 3), (2, 4), (4, 5), (5, 10), (5, 11), (4, 9), (4, 10), (4, 11), (6, 9), (7, 9), (9, 10), (9, 11), (6, 10), (7, 10), (10, 11), (7, 11), (6, 7), (6, 8), (7, 8).
Question: What is the density of the graph?
You need to format your answer as a float number. | 0.4 | graph_density |
The task is to determine the Wiener index of a connected graph.
The Wiener index of a graph is the sum of the shortest-path distances between each pair of reachable nodes. For pairs of nodes in undirected graphs, only one orientation of the pair is counted.
Here is an undirected graph. In the graph, (u, v) means that node u and node v are connected. The graph contains nodes: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, and 21. The graph contains edges: (1, 5), (1, 10), (1, 6), (5, 13), (5, 10), (5, 6), (5, 14), (5, 16), (3, 10), (6, 10), (7, 10), (10, 12), (10, 13), (10, 18), (10, 21), (10, 11), (10, 14), (10, 15), (10, 20), (10, 19), (2, 6), (4, 6), (6, 12), (6, 13), (6, 9), (6, 7), (6, 18), (6, 21), (6, 14), (6, 17), (6, 20), (2, 12), (2, 13), (2, 11), (2, 14), (2, 17), (2, 15), (2, 19), (8, 12), (12, 13), (12, 17), (12, 20), (12, 19), (4, 13), (7, 13), (13, 18), (7, 11), (14, 18), (17, 18), (9, 15), (3, 7), (7, 9), (8, 9), (9, 21).
Question: What is the Wiener index of the graph?
You need to format your answer as a float number. | 395.0 | graph_wiener_index |
The task is to determine the transitivity of a graph.
Transitivity is the ratio of the number of triangles in the graph to the number of connected triples of nodes.
Here is an undirected graph. In the graph, (u, v) means that node u and node v are connected. The graph contains nodes: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, and 25. The graph contains edges: (1, 4), (1, 3), (3, 4), (3, 15), (2, 23), (2, 24), (2, 6), (2, 7), (19, 23), (21, 23), (23, 24), (19, 24), (21, 24), (22, 24), (5, 6), (6, 7), (5, 7), (8, 11), (9, 11), (10, 11), (11, 12), (9, 10), (9, 12), (10, 12), (13, 25), (14, 25), (18, 25), (14, 16), (16, 20), (17, 20), (18, 20), (17, 18), (19, 21), (19, 22), (21, 22).
Question: What is the transitivity of the graph?
You need to format your answer as a float number. | 0.631578947368421 | graph_transitivity |
The task is to determine the betweenness centrality of a node in the graph.
Betweenness centrality of a node u is the sum of the fraction of all-pairs shortest paths that pass through u.
Here is an undirected graph. In the graph, (u, v) means that node u and node v are connected. The graph contains nodes: 1, 2, 3, 4, 5, 6, 7, 8, 9, and 10. The graph contains edges: (1, 2), (1, 3), (3, 4), (5, 6), (5, 7), (6, 7), (7, 8), (7, 10), (8, 9).
Question: What is the betweenness centrality of node 1 in the graph?
You need to format your answer as a float number. | 0.05555555555555555 | graph_betweenness_centrality |
The task is to determine the number of edges in the graph. For the undirected graph, you should count the edge between two nodes only once.
Here is an undirected graph. In the graph, (u, v) means that node u and node v are connected. The graph contains nodes: 1, 2, 3, 4, 5, 6, 7, 8, 9, and 10. The graph contains edges: (1, 2), (1, 5), (1, 7), (1, 6), (1, 8), (2, 3), (2, 4), (2, 5), (2, 6), (5, 10), (5, 6), (3, 7), (7, 8), (4, 9), (4, 10), (9, 10).
Question: How many edges are there in the graph?
| 16 | graph_edge_number |
The task is to determine the barycenter of a graph.
The barycenter of a graph is also called the median. It includes the node that minimizes the sum of distances to all other nodes.
Here is an undirected graph. In the graph, (u, v) means that node u and node v are connected. The graph contains nodes: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, and 19. The graph contains edges: (1, 10), (1, 17), (9, 10), (10, 12), (2, 4), (4, 13), (4, 11), (3, 18), (18, 19), (5, 13), (7, 13), (11, 13), (8, 11), (11, 14), (11, 15), (11, 12), (5, 7), (6, 7), (7, 8), (8, 15), (14, 15), (9, 12), (14, 16), (14, 19).
Question: What is the barycenter of the graph?
You need to format your answer as a list of nodes in ascending order, e.g., [node-1, node-2, ..., node-n]. | [11] | graph_barycenter |
The task is to determine the effective size of a node in a graph.
The effective size of a node is the number of nodes that are not directly connected to it, but are connected to its neighbors.
Here is an undirected graph. In the graph, (u, v) means that node u and node v are connected. The graph contains nodes: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, and 13. The graph contains edges: (1, 2), (2, 4), (2, 11), (4, 8), (3, 6), (3, 12), (6, 9), (5, 8), (5, 10), (5, 7), (9, 13).
Question: What is the effective size of node 2 in the graph?
You need to format your answer as a float number. | 3.0 | graph_effective_size |
The task is to determine the minimum spanning tree of a graph.
A minimum spanning tree is a subset of the edges that connects all vertices in the graph with the minimum possible total edge weight. If not specified, all edges have equal edge weights
Here is an undirected graph. In the graph, (u, v) means that node u and node v are connected. The graph contains nodes: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, and 34. The graph contains edges: (1, 32), (21, 32), (2, 14), (2, 17), (14, 33), (14, 17), (17, 19), (3, 25), (3, 6), (3, 4), (4, 25), (15, 25), (6, 8), (6, 29), (6, 20), (4, 15), (15, 27), (5, 28), (8, 28), (13, 28), (8, 13), (8, 26), (8, 21), (26, 29), (19, 20), (7, 24), (7, 16), (24, 30), (10, 16), (11, 16), (16, 23), (13, 22), (21, 31), (9, 34), (9, 12), (11, 34), (12, 34), (10, 23), (10, 31), (18, 22), (18, 27).
Question: What is the minimum spanning tree of the graph?
You need to format your answer as a list of edges in ascending dictionary order, e.g., [(u1, v1), (u2, v2), ..., (un, vn)]. | [(1,32),(2,14),(2,17),(3,4),(3,6),(3,25),(4,15),(5,28),(6,8),(6,20),(6,29),(7,16),(7,24),(8,13),(8,21),(8,26),(8,28),(9,12),(9,34),(10,16),(10,23),(10,31),(11,16),(11,34),(13,22),(14,33),(15,27),(17,19),(18,27),(19,20),(21,31),(21,32),(24,30)] | graph_minimum_spanning_tree |
The task is to determine the dominating set of a graph.
A dominating set is a subset of nodes such that every node in the graph is either in the set or adjacent to a node in the set.
Here is an undirected graph. In the graph, (u, v) means that node u and node v are connected. The graph contains nodes: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, and 28. The graph contains edges: (1, 20), (1, 4), (1, 7), (1, 23), (10, 20), (11, 20), (4, 28), (7, 28), (7, 10), (10, 23), (23, 28), (2, 15), (2, 16), (12, 15), (16, 26), (3, 14), (3, 6), (14, 25), (5, 25), (5, 21), (13, 21), (8, 11), (8, 24), (9, 22), (17, 22), (12, 17), (13, 19), (19, 27), (18, 27).
Question: What is the dominating set of the graph?
You need to format your answer as a list of nodes in ascending order, e.g., [node-1, node-2, ..., node-n]. | [1,2,3,5,8,9,10,12,13,18,26,28] | graph_dominating_set |
The task is to determine the degree centrality of a node in the graph.
The degree centrality values are normalized by dividing by the maximum possible degree in a graph.
Here is an undirected graph. In the graph, (u, v) means that node u and node v are connected. The graph contains nodes: 1, 2, 3, 4, and 5. The graph contains edges: (1, 4), (1, 2), (1, 5), (3, 4).
Question: What is the degree centrality of node 2 in the graph?
You need to format your answer as a float number. | 0.25 | graph_degree_centrality |
The task is to determine the betweenness centrality of a node in the graph.
Betweenness centrality of a node u is the sum of the fraction of all-pairs shortest paths that pass through u.
Here is an undirected graph. In the graph, (u, v) means that node u and node v are connected. The graph contains nodes: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, and 12. The graph contains edges: (1, 12), (2, 12), (9, 12), (2, 9), (2, 8), (5, 9), (3, 8), (5, 8), (3, 7), (4, 7), (4, 10), (10, 11), (5, 6).
Question: What is the betweenness centrality of node 1 in the graph?
You need to format your answer as a float number. | 0.0 | graph_betweenness_centrality |
The task is to determine the diameter of a graph.
The diameter of a graph is the longest shortest path between any two nodes in the graph.
Here is an undirected graph. In the graph, (u, v) means that node u and node v are connected. The graph contains nodes: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, and 29. The graph contains edges: (1, 2), (1, 4), (1, 7), (1, 13), (1, 16), (1, 17), (1, 20), (1, 22), (1, 24), (1, 25), (1, 27), (1, 29), (1, 3), (1, 6), (1, 8), (1, 9), (1, 14), (1, 18), (1, 28), (1, 5), (1, 10), (1, 11), (1, 12), (1, 15), (1, 19), (1, 21), (1, 23), (1, 26), (2, 4), (2, 7), (2, 13), (2, 16), (2, 17), (2, 20), (2, 22), (2, 24), (2, 25), (2, 27), (2, 29), (2, 3), (2, 6), (2, 8), (2, 9), (2, 14), (2, 18), (2, 28), (2, 10), (2, 11), (2, 12), (2, 15), (2, 19), (2, 21), (2, 23), (2, 26), (3, 4), (4, 7), (4, 13), (4, 16), (4, 17), (4, 20), (4, 22), (4, 24), (4, 25), (4, 27), (4, 29), (4, 6), (4, 8), (4, 9), (4, 14), (4, 18), (4, 28), (4, 5), (4, 10), (4, 11), (4, 12), (4, 15), (4, 19), (4, 21), (4, 23), (4, 26), (3, 7), (5, 7), (6, 7), (7, 13), (7, 16), (7, 17), (7, 20), (7, 22), (7, 24), (7, 25), (7, 27), (7, 29), (7, 8), (7, 9), (7, 14), (7, 18), (7, 28), (7, 10), (7, 11), (7, 12), (7, 15), (7, 19), (7, 21), (7, 23), (7, 26), (3, 13), (5, 13), (6, 13), (8, 13), (9, 13), (10, 13), (11, 13), (12, 13), (13, 16), (13, 17), (13, 20), (13, 22), (13, 24), (13, 25), (13, 27), (13, 29), (13, 14), (13, 18), (13, 28), (13, 15), (13, 19), (13, 21), (13, 23), (13, 26), (3, 16), (5, 16), (6, 16), (8, 16), (9, 16), (10, 16), (11, 16), (12, 16), (14, 16), (15, 16), (16, 17), (16, 20), (16, 22), (16, 24), (16, 25), (16, 27), (16, 29), (16, 18), (16, 28), (16, 19), (16, 21), (16, 23), (16, 26), (3, 17), (5, 17), (6, 17), (8, 17), (9, 17), (10, 17), (11, 17), (12, 17), (14, 17), (15, 17), (17, 22), (17, 24), (17, 25), (17, 27), (17, 29), (17, 18), (17, 28), (17, 19), (17, 21), (17, 23), (17, 26), (3, 20), (5, 20), (6, 20), (8, 20), (9, 20), (10, 20), (11, 20), (12, 20), (14, 20), (15, 20), (18, 20), (19, 20), (20, 22), (20, 24), (20, 25), (20, 27), (20, 29), (20, 28), (20, 21), (20, 23), (20, 26), (3, 22), (5, 22), (6, 22), (8, 22), (9, 22), (10, 22), (11, 22), (12, 22), (14, 22), (15, 22), (18, 22), (19, 22), (21, 22), (22, 24), (22, 25), (22, 27), (22, 29), (22, 28), (22, 23), (22, 26), (3, 24), (5, 24), (6, 24), (8, 24), (9, 24), (10, 24), (11, 24), (12, 24), (14, 24), (15, 24), (18, 24), (19, 24), (21, 24), (23, 24), (24, 25), (24, 27), (24, 29), (24, 28), (24, 26), (3, 25), (5, 25), (6, 25), (8, 25), (9, 25), (10, 25), (11, 25), (12, 25), (14, 25), (15, 25), (18, 25), (19, 25), (21, 25), (23, 25), (25, 27), (25, 29), (25, 28), (25, 26), (3, 27), (5, 27), (6, 27), (8, 27), (9, 27), (10, 27), (11, 27), (12, 27), (14, 27), (15, 27), (18, 27), (19, 27), (21, 27), (23, 27), (26, 27), (27, 29), (27, 28), (3, 29), (5, 29), (6, 29), (8, 29), (9, 29), (10, 29), (11, 29), (12, 29), (14, 29), (15, 29), (18, 29), (19, 29), (21, 29), (23, 29), (26, 29), (28, 29), (3, 6), (3, 8), (3, 9), (3, 14), (3, 18), (3, 28), (3, 5), (3, 10), (3, 11), (3, 12), (3, 15), (3, 19), (3, 21), (3, 23), (3, 26), (5, 6), (6, 8), (6, 9), (6, 14), (6, 18), (6, 28), (6, 10), (6, 11), (6, 12), (6, 15), (6, 19), (6, 21), (6, 23), (6, 26), (5, 8), (8, 9), (8, 14), (8, 18), (8, 28), (8, 10), (8, 11), (8, 12), (8, 15), (8, 19), (8, 21), (8, 23), (8, 26), (5, 9), (9, 14), (9, 18), (9, 28), (9, 10), (9, 11), (9, 12), (9, 15), (9, 19), (9, 21), (9, 23), (9, 26), (5, 14), (10, 14), (11, 14), (12, 14), (14, 18), (14, 28), (14, 15), (14, 19), (14, 21), (14, 23), (14, 26), (5, 18), (10, 18), (11, 18), (12, 18), (15, 18), (18, 28), (18, 19), (18, 21), (18, 23), (18, 26), (5, 28), (10, 28), (11, 28), (12, 28), (15, 28), (19, 28), (21, 28), (23, 28), (26, 28), (5, 10), (5, 11), (5, 12), (5, 15), (5, 19), (5, 21), (5, 23), (5, 26), (10, 12), (10, 15), (10, 19), (10, 21), (10, 23), (10, 26), (11, 12), (11, 15), (11, 19), (11, 21), (11, 23), (11, 26), (12, 15), (12, 19), (12, 21), (12, 23), (12, 26), (15, 19), (15, 21), (15, 23), (15, 26), (19, 21), (19, 23), (19, 26), (21, 23), (21, 26), (23, 26).
Question: What is the diameter of the graph?
| 2 | graph_diameter |
The task is to determine the closeness centrality of a node in the graph.
For a node u, closeness centrality is the reciprocal of the average shortest path distance to u over all n-1 reachable nodes. For directed graphs, it computes the incoming distance to u.
Here is an undirected graph. In the graph, (u, v) means that node u and node v are connected. The graph contains nodes: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, and 31. The graph contains edges: (1, 25), (1, 17), (25, 29), (4, 17), (17, 26), (2, 4), (2, 10), (3, 15), (3, 31), (15, 20), (16, 31), (5, 29), (6, 12), (6, 9), (12, 28), (9, 11), (9, 19), (7, 18), (18, 21), (8, 11), (8, 19), (19, 23), (13, 30), (23, 30), (27, 30), (14, 22), (22, 27), (16, 24), (16, 21).
Question: What is the closeness centrality of node 11 in the graph?
You need to format your answer as a float number. | 0.11162790697674418 | graph_closeness_centrality |
The task is to determine if there is a triangle in the graph that includes a specific node.
Here is an undirected graph. In the graph, (u, v) means that node u and node v are connected. The graph contains nodes: 1, 2, 3, 4, 5, 6, 7, and 8. The graph contains edges: (1, 2), (1, 5), (1, 6), (1, 4), (2, 3), (2, 4), (5, 7), (5, 8), (4, 6), (6, 7), (6, 8), (3, 4), (7, 8).
Question: Is there a triangle in the graph that includes node 7?
Your answer should be Yes or No. | Yes | graph_triangle_detection |
The task is to determine the effective size of a node in a graph.
The effective size of a node is the number of nodes that are not directly connected to it, but are connected to its neighbors.
Here is an undirected graph. In the graph, (u, v) means that node u and node v are connected. The graph contains nodes: 1, 2, 3, 4, 5, 6, 7, and 8. The graph contains edges: (1, 2), (1, 3), (3, 8), (7, 8), (4, 5), (5, 6), (6, 7).
Question: What is the effective size of node 1 in the graph?
You need to format your answer as a float number. | 2.0 | graph_effective_size |
The task is to determine the density of the graph.
Density is defined as the ratio of the number of edges in the graph to the number of possible edges. For undirected graphs, the density is 2*m/(n*(n-1)), where m is the edge number and n is the node number. For directed graphs, the density is m/(n*(n-1)).
Here is a directed graph. In the graph, (u, v) means that there is an edge from node u to node v. The graph contains nodes: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, and 26. The graph contains edges: (1, 4), (1, 21), (1, 15), (4, 3), (4, 21), (4, 16), (4, 12), (4, 24), (4, 23), (4, 15), (4, 17), (4, 5), (21, 3), (21, 4), (21, 7), (21, 14), (21, 8), (21, 18), (21, 16), (21, 22), (21, 12), (21, 24), (21, 23), (21, 15), (21, 6), (21, 9), (15, 4), (15, 18), (15, 21), (15, 19), (15, 1), (15, 10), (15, 12), (15, 24), (15, 23), (15, 9), (15, 5), (2, 14), (14, 4), (14, 25), (14, 13), (14, 8), (14, 18), (14, 21), (14, 16), (14, 22), (14, 12), (14, 11), (14, 23), (14, 9), (3, 13), (3, 8), (3, 21), (3, 16), (3, 22), (3, 12), (3, 11), (3, 23), (3, 15), (3, 17), (3, 6), (3, 9), (3, 2), (13, 7), (13, 14), (13, 21), (8, 14), (8, 18), (8, 22), (8, 23), (8, 15), (8, 9), (16, 3), (16, 13), (16, 21), (16, 12), (16, 11), (16, 24), (16, 23), (16, 17), (16, 9), (16, 2), (22, 3), (22, 4), (22, 25), (22, 14), (22, 8), (22, 18), (22, 21), (22, 12), (22, 11), (22, 24), (22, 23), (22, 9), (12, 3), (12, 4), (12, 25), (12, 14), (12, 18), (12, 21), (12, 16), (12, 22), (12, 11), (12, 24), (12, 23), (12, 15), (12, 9), (12, 5), (11, 3), (11, 18), (11, 21), (11, 16), (11, 22), (11, 12), (11, 23), (11, 17), (11, 9), (23, 3), (23, 4), (23, 25), (23, 14), (23, 8), (23, 18), (23, 21), (23, 16), (23, 22), (23, 10), (23, 12), (23, 11), (23, 24), (23, 15), (23, 17), (23, 9), (17, 3), (17, 8), (17, 21), (17, 22), (17, 6), (17, 9), (6, 3), (6, 17), (6, 9), (9, 3), (9, 4), (9, 14), (9, 8), (9, 18), (9, 21), (9, 16), (9, 22), (9, 19), (9, 12), (9, 11), (9, 24), (9, 23), (9, 26), (24, 4), (24, 14), (24, 8), (24, 16), (24, 22), (24, 12), (24, 11), (24, 23), (24, 15), (24, 9), (24, 5), (5, 4), (5, 23), (5, 26), (26, 13), (26, 21), (26, 5), (7, 14), (7, 21), (7, 12), (7, 23), (7, 9), (18, 3), (18, 4), (18, 25), (18, 14), (18, 21), (18, 22), (18, 12), (18, 23), (18, 15), (19, 20), (19, 1), (10, 15), (25, 4), (25, 7), (25, 14), (25, 8), (25, 18), (25, 21), (25, 22), (25, 11), (25, 23), (25, 9), (20, 4), (20, 21), (20, 19), (20, 15).
Question: What is the density of the graph?
You need to format your answer as a float number. | 0.31384615384615383 | graph_density |
The task is to determine the periphery of a graph.
The periphery of a graph is the set of nodes that are farthest from the center of the graph.
Here is an undirected graph. In the graph, (u, v) means that node u and node v are connected. The graph contains nodes: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, and 27. The graph contains edges: (1, 19), (1, 23), (3, 19), (5, 19), (19, 20), (19, 23), (20, 23), (2, 21), (12, 21), (3, 5), (3, 6), (3, 14), (5, 16), (6, 12), (6, 14), (14, 27), (4, 26), (4, 8), (4, 18), (22, 26), (8, 20), (8, 24), (16, 17), (16, 22), (12, 15), (7, 15), (7, 22), (11, 15), (15, 17), (11, 24), (9, 13), (9, 10), (13, 25), (10, 17).
Question: What is the periphery of the graph?
You need to format your answer as a list of nodes in ascending order, e.g., [node-1, node-2, ..., node-n]. | [18,25,27] | graph_periphery |
The task is to determine the periphery of a graph.
The periphery of a graph is the set of nodes that are farthest from the center of the graph.
Here is an undirected graph. In the graph, (u, v) means that node u and node v are connected. The graph contains nodes: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, and 22. The graph contains edges: (1, 2), (1, 5), (1, 7), (1, 8), (1, 11), (1, 12), (1, 13), (1, 16), (1, 18), (1, 20), (1, 3), (1, 4), (1, 9), (1, 21), (1, 22), (1, 10), (1, 17), (1, 6), (1, 19), (1, 14), (2, 5), (2, 7), (2, 8), (2, 11), (2, 12), (2, 13), (2, 16), (2, 18), (2, 20), (2, 3), (2, 4), (2, 9), (2, 15), (2, 21), (2, 22), (2, 10), (2, 17), (2, 6), (2, 19), (3, 5), (4, 5), (5, 7), (5, 8), (5, 11), (5, 12), (5, 13), (5, 16), (5, 18), (5, 20), (5, 9), (5, 15), (5, 21), (5, 22), (5, 10), (5, 17), (3, 7), (4, 7), (6, 7), (7, 8), (7, 11), (7, 12), (7, 13), (7, 16), (7, 18), (7, 20), (7, 15), (7, 22), (7, 17), (7, 19), (7, 14), (4, 8), (6, 8), (8, 11), (8, 12), (8, 13), (8, 16), (8, 18), (8, 20), (8, 9), (8, 15), (8, 21), (8, 22), (8, 10), (8, 17), (8, 19), (8, 14), (3, 11), (6, 11), (9, 11), (10, 11), (11, 12), (11, 13), (11, 16), (11, 18), (11, 20), (11, 15), (11, 21), (11, 22), (11, 19), (11, 14), (3, 12), (4, 12), (6, 12), (9, 12), (10, 12), (12, 13), (12, 16), (12, 18), (12, 20), (12, 15), (12, 21), (12, 17), (12, 19), (12, 14), (4, 13), (6, 13), (10, 13), (13, 20), (13, 15), (13, 21), (13, 17), (13, 19), (13, 14), (14, 16), (15, 16), (16, 20), (16, 21), (16, 19), (6, 18), (9, 18), (3, 6), (3, 14).
Question: What is the periphery of the graph?
You need to format your answer as a list of nodes in ascending order, e.g., [node-1, node-2, ..., node-n]. | [1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22] | graph_periphery |
The task is to determine if the graph is Eulerian.
An Eulerian graph is a graph that contains an Eulerian circuit, which is a cycle that visits every edge exactly once.
Here is an undirected graph. In the graph, (u, v) means that node u and node v are connected. The graph contains nodes: 1, 2, 3, 4, 5, 6, 7, 8, and 9. The graph contains edges: (1, 3), (3, 5), (2, 7), (2, 4), (6, 7), (4, 5), (5, 9), (6, 8).
Question: Is the graph Eulerian?
Your answer should be Yes or No. | No | graph_is_eularian |
The task is to determine the radius of a graph.
The radius of a graph is the minimum eccentricity of any node in the graph.
Here is an undirected graph. In the graph, (u, v) means that node u and node v are connected. The graph contains nodes: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, and 14. The graph contains edges: (1, 10), (1, 5), (1, 8), (1, 11), (1, 9), (5, 8), (5, 11), (5, 9), (4, 8), (8, 11), (8, 12), (9, 11), (11, 12), (9, 13), (2, 14), (2, 3), (2, 6), (2, 7), (3, 14), (3, 13), (6, 7).
Question: What is the radius of the graph?
| 4 | graph_radius |
The task is to determine the number of isolated nodes in the graph.
An isolated node is a node that has no edges connecting it to any other nodes.
Here is an undirected graph. In the graph, (u, v) means that node u and node v are connected. The graph contains nodes: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, and 28. The graph contains edges: (1, 8), (8, 9), (2, 27), (25, 27), (3, 4), (3, 5), (3, 6), (4, 5), (5, 6), (5, 7), (6, 7), (9, 13), (9, 14), (9, 15), (13, 14), (14, 15), (10, 16), (10, 11), (11, 12), (11, 18), (17, 18), (18, 22), (18, 24), (22, 24), (19, 20), (19, 21), (20, 21), (21, 23), (23, 25), (23, 26), (25, 26), (25, 28), (26, 28).
Question: How many isolated nodes are there in the graph?
| 0 | graph_isolate_number |
The task is to determine the betweenness centrality of a node in the graph.
Betweenness centrality of a node u is the sum of the fraction of all-pairs shortest paths that pass through u.
Here is an undirected graph. In the graph, (u, v) means that node u and node v are connected. The graph contains nodes: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, and 20. The graph contains edges: (1, 2), (1, 3), (1, 4), (2, 3), (2, 7), (2, 5), (2, 8), (3, 11), (3, 7), (5, 7), (7, 11), (5, 6), (5, 13), (5, 8), (8, 12), (8, 13), (11, 19), (11, 17), (6, 17), (12, 13), (13, 18), (16, 17), (17, 19), (12, 18), (9, 10), (19, 20), (14, 18), (15, 18), (14, 15).
Question: What is the betweenness centrality of node 16 in the graph?
You need to format your answer as a float number. | 0.0 | graph_betweenness_centrality |
The task is to determine if there is a triangle in the graph that includes a specific node.
Here is an undirected graph. In the graph, (u, v) means that node u and node v are connected. The graph contains nodes: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, and 30. The graph contains edges: (1, 5), (1, 6), (5, 18), (6, 23), (2, 27), (9, 27), (26, 27), (3, 4), (3, 15), (3, 28), (4, 30), (4, 15), (11, 15), (18, 28), (20, 28), (22, 28), (18, 19), (18, 21), (18, 20), (18, 22), (21, 23), (7, 8), (7, 9), (8, 10), (8, 13), (9, 12), (9, 24), (9, 26), (9, 13), (9, 17), (10, 13), (10, 14), (13, 29), (12, 16), (12, 17), (24, 25), (24, 26), (25, 26), (14, 29), (19, 20), (20, 22).
Question: Is there a triangle in the graph that includes node 17?
Your answer should be Yes or No. | Yes | graph_triangle_detection |
The task is to determine the local connectivity of two nodes in the graph.
Local connectivity is whether there exists at least one path between the two nodes.
Here is an undirected graph. In the graph, (u, v) means that node u and node v are connected. The graph contains nodes: 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, and 17. The graph contains edges: (1, 6), (1, 10), (3, 6), (3, 10), (8, 10), (2, 16), (11, 16), (3, 8), (3, 17), (8, 12), (5, 17), (15, 17), (4, 15), (5, 15), (7, 11), (7, 13), (9, 13), (9, 14).
Question: What is the local connectivity between node 11 and node 6 in the graph?
| No | graph_local_connectivity |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.