task stringclasses 7
values | prompt stringlengths 345 5.83k | answer stringlengths 9 132 | source_file stringlengths 53 86 |
|---|---|---|---|
edge_existence | Given two nodes in a graph, the task is to determine if there is an edge connecting the two nodes, regardless of direction.
Return the answer using Yes or No, starting with 'Answer:'.
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,... | Answer: Yes | /data2/graph/networkrepository/sampled/scc_rt_bahrain/Tiny_5.npz |
edge_existence | Given two nodes in a graph, the task is to determine if there is an edge connecting the two nodes, regardless of direction.
Return the answer using Yes or No, starting with 'Answer:'.
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,... | Answer: No | /data2/graph/networkrepository/sampled/scc_rt_bahrain/Tiny_5.npz |
node_number | The task is to determine the number of nodes in the graph.
Return the answer as a single integer, starting with 'Answer:'..
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,... | Answer: 26 | /data2/graph/networkrepository/sampled/scc_rt_bahrain/Tiny_5.npz |
edge_number | 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.
Return the answer as a single integer, starting with 'Answer:'..
Here is an undirected graph. In the graph, (u, v) means that node u and node v are connected. The graph contains ... | Answer: 89 | /data2/graph/networkrepository/sampled/scc_rt_bahrain/Tiny_5.npz |
node_degree | 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.
Return the answer as a single integer, starting with 'Answer:'..
Here is an undirected graph. In the graph, (u, v) means that node u and node v are connected. The graph contains... | Answer: 13 | /data2/graph/networkrepository/sampled/scc_rt_bahrain/Tiny_5.npz |
node_degree | 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.
Return the answer as a single integer, starting with 'Answer:'..
Here is an undirected graph. In the graph, (u, v) means that node u and node v are connected. The graph contains... | Answer: 1 | /data2/graph/networkrepository/sampled/scc_rt_bahrain/Tiny_5.npz |
common_neighbor_number | The task is to determine the number of common neighbors between two nodes in the graph.
Return the answer as a single integer, starting with 'Answer:'..
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... | Answer: 6 | /data2/graph/networkrepository/sampled/scc_rt_bahrain/Tiny_5.npz |
common_neighbor_number | The task is to determine the number of common neighbors between two nodes in the graph.
Return the answer as a single integer, starting with 'Answer:'..
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... | Answer: 1 | /data2/graph/networkrepository/sampled/scc_rt_bahrain/Tiny_5.npz |
neighbor | The task is to determine the neighbors of a node in the graph.
Return the answer as a list of integers, starting with 'Answer:' and displaying in an ascending order.
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, 1... | Answer: [2, 3, 4, 5, 7, 8, 9, 12, 13, 17, 18, 19, 21] | /data2/graph/networkrepository/sampled/scc_rt_bahrain/Tiny_5.npz |
neighbor | The task is to determine the neighbors of a node in the graph.
Return the answer as a list of integers, starting with 'Answer:' and displaying in an ascending order.
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, 1... | Answer: [1] | /data2/graph/networkrepository/sampled/scc_rt_bahrain/Tiny_5.npz |
shortest_path | The task is to determine the shortest path between two nodes in the graph.
Return the answer as a list of integers, starting with 'Answer:'..
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, 1... | Answer: [] | /data2/graph/networkrepository/sampled/scc_rt_bahrain/Tiny_5.npz |
shortest_path | The task is to determine the shortest path between two nodes in the graph.
Return the answer as a list of integers, starting with 'Answer:'..
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, 1... | Answer: [] | /data2/graph/networkrepository/sampled/scc_rt_bahrain/Tiny_5.npz |
edge_existence | Given two nodes in a graph, the task is to determine if there is an edge connecting the two nodes, regardless of direction.
Return the answer using Yes or No, starting with 'Answer:'.
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,... | Answer: Yes | /data2/graph/networkrepository/sampled/scc_rt_bahrain/Tiny_8.npz |
edge_existence | Given two nodes in a graph, the task is to determine if there is an edge connecting the two nodes, regardless of direction.
Return the answer using Yes or No, starting with 'Answer:'.
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,... | Answer: No | /data2/graph/networkrepository/sampled/scc_rt_bahrain/Tiny_8.npz |
node_number | The task is to determine the number of nodes in the graph.
Return the answer as a single integer, starting with 'Answer:'..
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 gra... | Answer: 18 | /data2/graph/networkrepository/sampled/scc_rt_bahrain/Tiny_8.npz |
edge_number | 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.
Return the answer as a single integer, starting with 'Answer:'..
Here is an undirected graph. In the graph, (u, v) means that node u and node v are connected. The graph contains ... | Answer: 54 | /data2/graph/networkrepository/sampled/scc_rt_bahrain/Tiny_8.npz |
node_degree | 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.
Return the answer as a single integer, starting with 'Answer:'..
Here is an undirected graph. In the graph, (u, v) means that node u and node v are connected. The graph contains... | Answer: 4 | /data2/graph/networkrepository/sampled/scc_rt_bahrain/Tiny_8.npz |
node_degree | 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.
Return the answer as a single integer, starting with 'Answer:'..
Here is an undirected graph. In the graph, (u, v) means that node u and node v are connected. The graph contains... | Answer: 9 | /data2/graph/networkrepository/sampled/scc_rt_bahrain/Tiny_8.npz |
common_neighbor_number | The task is to determine the number of common neighbors between two nodes in the graph.
Return the answer as a single integer, starting with 'Answer:'..
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... | Answer: 6 | /data2/graph/networkrepository/sampled/scc_rt_bahrain/Tiny_8.npz |
common_neighbor_number | The task is to determine the number of common neighbors between two nodes in the graph.
Return the answer as a single integer, starting with 'Answer:'..
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... | Answer: 5 | /data2/graph/networkrepository/sampled/scc_rt_bahrain/Tiny_8.npz |
neighbor | The task is to determine the neighbors of a node in the graph.
Return the answer as a list of integers, starting with 'Answer:' and displaying in an ascending order.
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, 1... | Answer: [7, 9, 14, 16] | /data2/graph/networkrepository/sampled/scc_rt_bahrain/Tiny_8.npz |
neighbor | The task is to determine the neighbors of a node in the graph.
Return the answer as a list of integers, starting with 'Answer:' and displaying in an ascending order.
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, 1... | Answer: [3, 4, 5, 7, 9, 10, 12, 16, 18] | /data2/graph/networkrepository/sampled/scc_rt_bahrain/Tiny_8.npz |
shortest_path | The task is to determine the shortest path between two nodes in the graph.
Return the answer as a list of integers, starting with 'Answer:'..
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, 1... | Answer: [16, 5] | /data2/graph/networkrepository/sampled/scc_rt_bahrain/Tiny_8.npz |
shortest_path | The task is to determine the shortest path between two nodes in the graph.
Return the answer as a list of integers, starting with 'Answer:'..
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, 1... | Answer: [3, 2, 18] | /data2/graph/networkrepository/sampled/scc_rt_bahrain/Tiny_8.npz |
edge_existence | Given two nodes in a graph, the task is to determine if there is an edge connecting the two nodes, regardless of direction.
Return the answer using Yes or No, starting with 'Answer:'.
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,... | Answer: Yes | /data2/graph/networkrepository/sampled/scc_rt_bahrain/Tiny_7.npz |
edge_existence | Given two nodes in a graph, the task is to determine if there is an edge connecting the two nodes, regardless of direction.
Return the answer using Yes or No, starting with 'Answer:'.
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,... | Answer: No | /data2/graph/networkrepository/sampled/scc_rt_bahrain/Tiny_7.npz |
node_number | The task is to determine the number of nodes in the graph.
Return the answer as a single integer, starting with 'Answer:'..
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,... | Answer: 23 | /data2/graph/networkrepository/sampled/scc_rt_bahrain/Tiny_7.npz |
edge_number | 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.
Return the answer as a single integer, starting with 'Answer:'..
Here is an undirected graph. In the graph, (u, v) means that node u and node v are connected. The graph contains ... | Answer: 87 | /data2/graph/networkrepository/sampled/scc_rt_bahrain/Tiny_7.npz |
node_degree | 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.
Return the answer as a single integer, starting with 'Answer:'..
Here is an undirected graph. In the graph, (u, v) means that node u and node v are connected. The graph contains... | Answer: 12 | /data2/graph/networkrepository/sampled/scc_rt_bahrain/Tiny_7.npz |
node_degree | 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.
Return the answer as a single integer, starting with 'Answer:'..
Here is an undirected graph. In the graph, (u, v) means that node u and node v are connected. The graph contains... | Answer: 1 | /data2/graph/networkrepository/sampled/scc_rt_bahrain/Tiny_7.npz |
common_neighbor_number | The task is to determine the number of common neighbors between two nodes in the graph.
Return the answer as a single integer, starting with 'Answer:'..
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... | Answer: 9 | /data2/graph/networkrepository/sampled/scc_rt_bahrain/Tiny_7.npz |
common_neighbor_number | The task is to determine the number of common neighbors between two nodes in the graph.
Return the answer as a single integer, starting with 'Answer:'..
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... | Answer: 1 | /data2/graph/networkrepository/sampled/scc_rt_bahrain/Tiny_7.npz |
neighbor | The task is to determine the neighbors of a node in the graph.
Return the answer as a list of integers, starting with 'Answer:' and displaying in an ascending order.
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, 1... | Answer: [2, 3, 4, 5, 7, 8, 9, 10, 14, 15, 16, 19] | /data2/graph/networkrepository/sampled/scc_rt_bahrain/Tiny_7.npz |
neighbor | The task is to determine the neighbors of a node in the graph.
Return the answer as a list of integers, starting with 'Answer:' and displaying in an ascending order.
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, 1... | Answer: [1] | /data2/graph/networkrepository/sampled/scc_rt_bahrain/Tiny_7.npz |
edge_existence | Given two nodes in a graph, the task is to determine if there is an edge connecting the two nodes, regardless of direction.
Return the answer using Yes or No, starting with 'Answer:'.
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,... | Answer: Yes | /data2/graph/networkrepository/sampled/scc_rt_bahrain/Tiny_16.npz |
edge_existence | Given two nodes in a graph, the task is to determine if there is an edge connecting the two nodes, regardless of direction.
Return the answer using Yes or No, starting with 'Answer:'.
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,... | Answer: No | /data2/graph/networkrepository/sampled/scc_rt_bahrain/Tiny_16.npz |
node_number | The task is to determine the number of nodes in the graph.
Return the answer as a single integer, starting with 'Answer:'..
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... | Answer: 19 | /data2/graph/networkrepository/sampled/scc_rt_bahrain/Tiny_16.npz |
edge_number | 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.
Return the answer as a single integer, starting with 'Answer:'..
Here is an undirected graph. In the graph, (u, v) means that node u and node v are connected. The graph contains ... | Answer: 71 | /data2/graph/networkrepository/sampled/scc_rt_bahrain/Tiny_16.npz |
node_degree | 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.
Return the answer as a single integer, starting with 'Answer:'..
Here is an undirected graph. In the graph, (u, v) means that node u and node v are connected. The graph contains... | Answer: 13 | /data2/graph/networkrepository/sampled/scc_rt_bahrain/Tiny_16.npz |
node_degree | 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.
Return the answer as a single integer, starting with 'Answer:'..
Here is an undirected graph. In the graph, (u, v) means that node u and node v are connected. The graph contains... | Answer: 1 | /data2/graph/networkrepository/sampled/scc_rt_bahrain/Tiny_16.npz |
common_neighbor_number | The task is to determine the number of common neighbors between two nodes in the graph.
Return the answer as a single integer, starting with 'Answer:'..
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... | Answer: 5 | /data2/graph/networkrepository/sampled/scc_rt_bahrain/Tiny_16.npz |
common_neighbor_number | The task is to determine the number of common neighbors between two nodes in the graph.
Return the answer as a single integer, starting with 'Answer:'..
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... | Answer: 4 | /data2/graph/networkrepository/sampled/scc_rt_bahrain/Tiny_16.npz |
neighbor | The task is to determine the neighbors of a node in the graph.
Return the answer as a list of integers, starting with 'Answer:' and displaying in an ascending order.
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, 1... | Answer: [2, 3, 4, 5, 7, 8, 9, 10, 11, 13, 14, 16, 18] | /data2/graph/networkrepository/sampled/scc_rt_bahrain/Tiny_16.npz |
neighbor | The task is to determine the neighbors of a node in the graph.
Return the answer as a list of integers, starting with 'Answer:' and displaying in an ascending order.
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, 1... | Answer: [1] | /data2/graph/networkrepository/sampled/scc_rt_bahrain/Tiny_16.npz |
shortest_path | The task is to determine the shortest path between two nodes in the graph.
Return the answer as a list of integers, starting with 'Answer:'..
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, 1... | Answer: [15, 11, 7, 17] | /data2/graph/networkrepository/sampled/scc_rt_bahrain/Tiny_16.npz |
shortest_path | The task is to determine the shortest path between two nodes in the graph.
Return the answer as a list of integers, starting with 'Answer:'..
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, 1... | Answer: [11, 3] | /data2/graph/networkrepository/sampled/scc_rt_bahrain/Tiny_16.npz |
edge_existence | Given two nodes in a graph, the task is to determine if there is an edge connecting the two nodes, regardless of direction.
Return the answer using Yes or No, starting with 'Answer:'.
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,... | Answer: Yes | /data2/graph/networkrepository/sampled/scc_rt_bahrain/Tiny_0.npz |
edge_existence | Given two nodes in a graph, the task is to determine if there is an edge connecting the two nodes, regardless of direction.
Return the answer using Yes or No, starting with 'Answer:'.
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,... | Answer: No | /data2/graph/networkrepository/sampled/scc_rt_bahrain/Tiny_0.npz |
node_number | The task is to determine the number of nodes in the graph.
Return the answer as a single integer, starting with 'Answer:'..
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... | Answer: 22 | /data2/graph/networkrepository/sampled/scc_rt_bahrain/Tiny_0.npz |
edge_number | 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.
Return the answer as a single integer, starting with 'Answer:'..
Here is an undirected graph. In the graph, (u, v) means that node u and node v are connected. The graph contains ... | Answer: 70 | /data2/graph/networkrepository/sampled/scc_rt_bahrain/Tiny_0.npz |
node_degree | 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.
Return the answer as a single integer, starting with 'Answer:'..
Here is an undirected graph. In the graph, (u, v) means that node u and node v are connected. The graph contains... | Answer: 10 | /data2/graph/networkrepository/sampled/scc_rt_bahrain/Tiny_0.npz |
node_degree | 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.
Return the answer as a single integer, starting with 'Answer:'..
Here is an undirected graph. In the graph, (u, v) means that node u and node v are connected. The graph contains... | Answer: 10 | /data2/graph/networkrepository/sampled/scc_rt_bahrain/Tiny_0.npz |
common_neighbor_number | The task is to determine the number of common neighbors between two nodes in the graph.
Return the answer as a single integer, starting with 'Answer:'..
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... | Answer: 1 | /data2/graph/networkrepository/sampled/scc_rt_bahrain/Tiny_0.npz |
common_neighbor_number | The task is to determine the number of common neighbors between two nodes in the graph.
Return the answer as a single integer, starting with 'Answer:'..
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... | Answer: 5 | /data2/graph/networkrepository/sampled/scc_rt_bahrain/Tiny_0.npz |
neighbor | The task is to determine the neighbors of a node in the graph.
Return the answer as a list of integers, starting with 'Answer:' and displaying in an ascending order.
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, 1... | Answer: [2, 3, 4, 6, 7, 8, 9, 12, 14, 15] | /data2/graph/networkrepository/sampled/scc_rt_bahrain/Tiny_0.npz |
neighbor | The task is to determine the neighbors of a node in the graph.
Return the answer as a list of integers, starting with 'Answer:' and displaying in an ascending order.
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, 1... | Answer: [1, 3, 4, 5, 6, 7, 9, 10, 12, 17] | /data2/graph/networkrepository/sampled/scc_rt_bahrain/Tiny_0.npz |
edge_existence | Given two nodes in a graph, the task is to determine if there is an edge connecting the two nodes, regardless of direction.
Return the answer using Yes or No, starting with 'Answer:'.
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,... | Answer: Yes | /data2/graph/networkrepository/sampled/scc_rt_bahrain/Tiny_3.npz |
edge_existence | Given two nodes in a graph, the task is to determine if there is an edge connecting the two nodes, regardless of direction.
Return the answer using Yes or No, starting with 'Answer:'.
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,... | Answer: No | /data2/graph/networkrepository/sampled/scc_rt_bahrain/Tiny_3.npz |
node_number | The task is to determine the number of nodes in the graph.
Return the answer as a single integer, starting with 'Answer:'..
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... | Answer: 21 | /data2/graph/networkrepository/sampled/scc_rt_bahrain/Tiny_3.npz |
edge_number | 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.
Return the answer as a single integer, starting with 'Answer:'..
Here is an undirected graph. In the graph, (u, v) means that node u and node v are connected. The graph contains ... | Answer: 83 | /data2/graph/networkrepository/sampled/scc_rt_bahrain/Tiny_3.npz |
node_degree | 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.
Return the answer as a single integer, starting with 'Answer:'..
Here is an undirected graph. In the graph, (u, v) means that node u and node v are connected. The graph contains... | Answer: 12 | /data2/graph/networkrepository/sampled/scc_rt_bahrain/Tiny_3.npz |
node_degree | 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.
Return the answer as a single integer, starting with 'Answer:'..
Here is an undirected graph. In the graph, (u, v) means that node u and node v are connected. The graph contains... | Answer: 1 | /data2/graph/networkrepository/sampled/scc_rt_bahrain/Tiny_3.npz |
common_neighbor_number | The task is to determine the number of common neighbors between two nodes in the graph.
Return the answer as a single integer, starting with 'Answer:'..
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... | Answer: 3 | /data2/graph/networkrepository/sampled/scc_rt_bahrain/Tiny_3.npz |
common_neighbor_number | The task is to determine the number of common neighbors between two nodes in the graph.
Return the answer as a single integer, starting with 'Answer:'..
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... | Answer: 7 | /data2/graph/networkrepository/sampled/scc_rt_bahrain/Tiny_3.npz |
neighbor | The task is to determine the neighbors of a node in the graph.
Return the answer as a list of integers, starting with 'Answer:' and displaying in an ascending order.
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, 1... | Answer: [2, 3, 4, 5, 6, 7, 8, 9, 13, 14, 16, 19] | /data2/graph/networkrepository/sampled/scc_rt_bahrain/Tiny_3.npz |
neighbor | The task is to determine the neighbors of a node in the graph.
Return the answer as a list of integers, starting with 'Answer:' and displaying in an ascending order.
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, 1... | Answer: [1] | /data2/graph/networkrepository/sampled/scc_rt_bahrain/Tiny_3.npz |
shortest_path | The task is to determine the shortest path between two nodes in the graph.
Return the answer as a list of integers, starting with 'Answer:'..
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, 1... | Answer: [4, 1, 14] | /data2/graph/networkrepository/sampled/scc_rt_bahrain/Tiny_3.npz |
shortest_path | The task is to determine the shortest path between two nodes in the graph.
Return the answer as a list of integers, starting with 'Answer:'..
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, 1... | Answer: [11, 3, 15] | /data2/graph/networkrepository/sampled/scc_rt_bahrain/Tiny_3.npz |
edge_existence | Given two nodes in a graph, the task is to determine if there is an edge connecting the two nodes, regardless of direction.
Return the answer using Yes or No, starting with 'Answer:'.
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,... | Answer: Yes | /data2/graph/networkrepository/sampled/scc_rt_bahrain/Tiny_12.npz |
edge_existence | Given two nodes in a graph, the task is to determine if there is an edge connecting the two nodes, regardless of direction.
Return the answer using Yes or No, starting with 'Answer:'.
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,... | Answer: No | /data2/graph/networkrepository/sampled/scc_rt_bahrain/Tiny_12.npz |
node_number | The task is to determine the number of nodes in the graph.
Return the answer as a single integer, starting with 'Answer:'..
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... | Answer: 21 | /data2/graph/networkrepository/sampled/scc_rt_bahrain/Tiny_12.npz |
edge_number | 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.
Return the answer as a single integer, starting with 'Answer:'..
Here is an undirected graph. In the graph, (u, v) means that node u and node v are connected. The graph contains ... | Answer: 74 | /data2/graph/networkrepository/sampled/scc_rt_bahrain/Tiny_12.npz |
node_degree | 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.
Return the answer as a single integer, starting with 'Answer:'..
Here is an undirected graph. In the graph, (u, v) means that node u and node v are connected. The graph contains... | Answer: 10 | /data2/graph/networkrepository/sampled/scc_rt_bahrain/Tiny_12.npz |
node_degree | 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.
Return the answer as a single integer, starting with 'Answer:'..
Here is an undirected graph. In the graph, (u, v) means that node u and node v are connected. The graph contains... | Answer: 5 | /data2/graph/networkrepository/sampled/scc_rt_bahrain/Tiny_12.npz |
common_neighbor_number | The task is to determine the number of common neighbors between two nodes in the graph.
Return the answer as a single integer, starting with 'Answer:'..
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... | Answer: 4 | /data2/graph/networkrepository/sampled/scc_rt_bahrain/Tiny_12.npz |
common_neighbor_number | The task is to determine the number of common neighbors between two nodes in the graph.
Return the answer as a single integer, starting with 'Answer:'..
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... | Answer: 3 | /data2/graph/networkrepository/sampled/scc_rt_bahrain/Tiny_12.npz |
neighbor | The task is to determine the neighbors of a node in the graph.
Return the answer as a list of integers, starting with 'Answer:' and displaying in an ascending order.
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, 1... | Answer: [2, 3, 5, 6, 7, 8, 11, 12, 17, 19] | /data2/graph/networkrepository/sampled/scc_rt_bahrain/Tiny_12.npz |
neighbor | The task is to determine the neighbors of a node in the graph.
Return the answer as a list of integers, starting with 'Answer:' and displaying in an ascending order.
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, 1... | Answer: [1, 3, 4, 5, 6] | /data2/graph/networkrepository/sampled/scc_rt_bahrain/Tiny_12.npz |
shortest_path | The task is to determine the shortest path between two nodes in the graph.
Return the answer as a list of integers, starting with 'Answer:'..
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, 1... | Answer: [3, 6] | /data2/graph/networkrepository/sampled/scc_rt_bahrain/Tiny_12.npz |
shortest_path | The task is to determine the shortest path between two nodes in the graph.
Return the answer as a list of integers, starting with 'Answer:'..
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, 1... | Answer: [14, 13] | /data2/graph/networkrepository/sampled/scc_rt_bahrain/Tiny_12.npz |
edge_existence | Given two nodes in a graph, the task is to determine if there is an edge connecting the two nodes, regardless of direction.
Return the answer using Yes or No, starting with 'Answer:'.
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,... | Answer: Yes | /data2/graph/networkrepository/sampled/scc_rt_bahrain/Tiny_4.npz |
edge_existence | Given two nodes in a graph, the task is to determine if there is an edge connecting the two nodes, regardless of direction.
Return the answer using Yes or No, starting with 'Answer:'.
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,... | Answer: No | /data2/graph/networkrepository/sampled/scc_rt_bahrain/Tiny_4.npz |
node_number | The task is to determine the number of nodes in the graph.
Return the answer as a single integer, starting with 'Answer:'..
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,... | Answer: 22 | /data2/graph/networkrepository/sampled/scc_rt_bahrain/Tiny_4.npz |
edge_number | 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.
Return the answer as a single integer, starting with 'Answer:'..
Here is an undirected graph. In the graph, (u, v) means that node u and node v are connected. The graph contains ... | Answer: 82 | /data2/graph/networkrepository/sampled/scc_rt_bahrain/Tiny_4.npz |
node_degree | 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.
Return the answer as a single integer, starting with 'Answer:'..
Here is an undirected graph. In the graph, (u, v) means that node u and node v are connected. The graph contains... | Answer: 10 | /data2/graph/networkrepository/sampled/scc_rt_bahrain/Tiny_4.npz |
node_degree | 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.
Return the answer as a single integer, starting with 'Answer:'..
Here is an undirected graph. In the graph, (u, v) means that node u and node v are connected. The graph contains... | Answer: 10 | /data2/graph/networkrepository/sampled/scc_rt_bahrain/Tiny_4.npz |
common_neighbor_number | The task is to determine the number of common neighbors between two nodes in the graph.
Return the answer as a single integer, starting with 'Answer:'..
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... | Answer: 9 | /data2/graph/networkrepository/sampled/scc_rt_bahrain/Tiny_4.npz |
common_neighbor_number | The task is to determine the number of common neighbors between two nodes in the graph.
Return the answer as a single integer, starting with 'Answer:'..
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... | Answer: 8 | /data2/graph/networkrepository/sampled/scc_rt_bahrain/Tiny_4.npz |
neighbor | The task is to determine the neighbors of a node in the graph.
Return the answer as a list of integers, starting with 'Answer:' and displaying in an ascending order.
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, 1... | Answer: [2, 3, 4, 5, 6, 7, 8, 11, 12, 14] | /data2/graph/networkrepository/sampled/scc_rt_bahrain/Tiny_4.npz |
neighbor | The task is to determine the neighbors of a node in the graph.
Return the answer as a list of integers, starting with 'Answer:' and displaying in an ascending order.
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, 1... | Answer: [1, 3, 4, 5, 6, 8, 9, 11, 12, 13] | /data2/graph/networkrepository/sampled/scc_rt_bahrain/Tiny_4.npz |
shortest_path | The task is to determine the shortest path between two nodes in the graph.
Return the answer as a list of integers, starting with 'Answer:'..
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, 1... | Answer: [9, 5] | /data2/graph/networkrepository/sampled/scc_rt_bahrain/Tiny_4.npz |
shortest_path | The task is to determine the shortest path between two nodes in the graph.
Return the answer as a list of integers, starting with 'Answer:'..
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, 1... | Answer: [5, 4, 18] | /data2/graph/networkrepository/sampled/scc_rt_bahrain/Tiny_4.npz |
edge_existence | Given two nodes in a graph, the task is to determine if there is an edge connecting the two nodes, regardless of direction.
Return the answer using Yes or No, starting with 'Answer:'.
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,... | Answer: Yes | /data2/graph/networkrepository/sampled/scc_rt_bahrain/Tiny_9.npz |
edge_existence | Given two nodes in a graph, the task is to determine if there is an edge connecting the two nodes, regardless of direction.
Return the answer using Yes or No, starting with 'Answer:'.
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,... | Answer: No | /data2/graph/networkrepository/sampled/scc_rt_bahrain/Tiny_9.npz |
node_number | The task is to determine the number of nodes in the graph.
Return the answer as a single integer, starting with 'Answer:'..
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,... | Answer: 30 | /data2/graph/networkrepository/sampled/scc_rt_bahrain/Tiny_9.npz |
edge_number | 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.
Return the answer as a single integer, starting with 'Answer:'..
Here is an undirected graph. In the graph, (u, v) means that node u and node v are connected. The graph contains ... | Answer: 98 | /data2/graph/networkrepository/sampled/scc_rt_bahrain/Tiny_9.npz |
node_degree | 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.
Return the answer as a single integer, starting with 'Answer:'..
Here is an undirected graph. In the graph, (u, v) means that node u and node v are connected. The graph contains... | Answer: 11 | /data2/graph/networkrepository/sampled/scc_rt_bahrain/Tiny_9.npz |
node_degree | 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.
Return the answer as a single integer, starting with 'Answer:'..
Here is an undirected graph. In the graph, (u, v) means that node u and node v are connected. The graph contains... | Answer: 12 | /data2/graph/networkrepository/sampled/scc_rt_bahrain/Tiny_9.npz |
common_neighbor_number | The task is to determine the number of common neighbors between two nodes in the graph.
Return the answer as a single integer, starting with 'Answer:'..
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... | Answer: 5 | /data2/graph/networkrepository/sampled/scc_rt_bahrain/Tiny_9.npz |
common_neighbor_number | The task is to determine the number of common neighbors between two nodes in the graph.
Return the answer as a single integer, starting with 'Answer:'..
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... | Answer: 1 | /data2/graph/networkrepository/sampled/scc_rt_bahrain/Tiny_9.npz |
End of preview. Expand in Data Studio
No dataset card yet
- Downloads last month
- 4