prompts stringlengths 279 11.1k | answers stringlengths 1 254 | tasks stringclasses 47
values |
|---|---|---|
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, and 7. The ... | 0.7222222222222223 | graph_global_efficiency |
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, and 19. The graph contains edges: (1, 2), (1, 4), (1, 3), (1, 5), (2, 3),... | [2,3,4,5] | graph_neighbor |
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, 28, 2... | [(30,32),(32,28),(32,33),(28,5),(28,26),(28,29),(5,7)] | 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... | 0.038461538461538464 | 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, ... | 0.0551470588235294 | graph_betweenness_centrality |
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 tha... | 0.3684210526315789 | graph_closeness_centrality |
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, 14, 15, 16, 17, 18, and 19. The ... | 6 | graph_radius |
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, ... | 1 | graph_connected_component_number |
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, and 8. The graph co... | No | graph_local_connectivity |
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: (2, 1), (3, 2), (... | [14,16,13,15,12,17,11,18,10,19,9,8,4,7,3,6,2,5,1] | graph_topological_sort |
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, and ... | [2,4,6,10,15] | graph_periphery |
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, 1... | No | graph_local_connectivity |
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 nod... | 6.0 | graph_harmonic_centrality |
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, and 20. The g... | [16,7,17,14,15,13,11,6,3,1,4,18,19] | graph_shortest_path |
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, ... | No | graph_triangle_detection |
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, and 5. The graph contains edges: (1, 5), (1, 4), (1, 3), (1, 2)... | 1 | graph_radius |
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, and 11. The graph contains edges: (1, 2), (1, 3), (2, 11), (2, 5), (2, 6), (3, 5), (8, 11), (6, 8), (4, 10), ... | 11 | graph_node_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... | 0.39634920634920623 | graph_global_efficiency |
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 ... | 1900.0 | graph_wiener_index |
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, ... | No | graph_triangle_detection |
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... | [1,2,11,25] | graph_dominating_set |
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, ... | 3 | graph_connected_component_number |
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,... | No | graph_is_bipartite |
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, ... | 0 | graph_adamic_adar_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,... | 0 | graph_transitivity |
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 ... | 0.5833333333333333 | graph_resource_allocation_index |
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 ... | 0.48703703703703705 | graph_resource_allocation_index |
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 ... | 1 | graph_weakly_connected_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,... | [14] | graph_barycenter |
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, 1... | 0 | graph_isolate_number |
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, and 15. The graph contains edges: (1, 15), (15, 13), (2, 3), (4, 12... | [1,7,9,15,5,8,13,2,10,14,3,6,11,4,12] | graph_topological_sort |
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:... | 17 | graph_strongly_connected_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... | [1,2,3,4,5,6,7,8,10,12,13,15,19,20,22] | graph_min_vertex_cover |
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 nod... | 4.333333333333334 | graph_harmonic_centrality |
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... | [(1,8),(6,2),(7,1),(10,13),(11,4),(12,5),(15,11),(16,14),(17,3),(18,9),(20,19)] | graph_min_edge_covering |
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 an... | [(1,2),(1,4),(1,5),(1,7),(1,8),(1,9),(1,11),(1,12),(1,13),(1,14),(1,15),(1,16),(2,3),(2,6),(2,10)] | graph_minimum_spanning_tree |
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 tha... | 0.1088888888888889 | graph_closeness_centrality |
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, and 10. The graph contains edges: (1, 4), (1, 6), (1, 5), (2, 4), (3, 4), (4,... | [(1,4),(1,5),(1,6),(4,2),(4,3),(4,7),(4,8),(4,9),(4,10)] | graph_bfs |
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, 1... | No | graph_local_connectivity |
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, and 12. The graph contains edges: (1, 2), (1, 6), (1, 3), (1, 9), (1, 10), (1, 11), (1, 8), (1, 7), (1, 1... | 12 | graph_node_number |
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, 2... | [33,17,18,19,12,13,4,25,27,31,21,20] | graph_shortest_path |
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,... | Yes | graph_is_bipartite |
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, ... | 0.7213475204444817 | graph_adamic_adar_index |
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, ... | 0 | graph_adamic_adar_index |
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, 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,... | Yes | graph_has_cycle |
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 u... | 0.2683982683982684 | graph_density |
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 ind... | [2,8,9,10,13] | graph_maximal_independent_set |
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... | 0.5 | graph_constraint |
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, ... | 1.0 | graph_effective_size |
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, 1... | 5 | graph_diameter |
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, ... | No | graph_triangle_detection |
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, ... | [1,17] | graph_center |
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, 1... | 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... | [1,2,3,4,5,6,7,8,9,10,12,13,15,16,17,18,19,20,22,23,24,27,28,29,30,33] | graph_min_vertex_cover |
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,... | 0 | graph_transitivity |
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 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: (1, 3)... | [1,5] | graph_periphery |
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,... | 0 | graph_triangles |
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, ... | [1,8] | graph_center |
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, 28, 2... | [(9,12),(12,29),(29,10),(29,27),(10,5),(27,18),(27,19),(27,26),(5,11),(5,14),(5,17),(18,15),(18,24),(19,1),(19,4),(19,13),(26,2),(26,3),(26,23),(11,22),(14,20),(14,28),(17,25),(17,30),(15,6),(15,16),(30,8),(30,21),(8,7)] | graph_bfs |
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 ... | 206.0 | graph_wiener_index |
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, and 5. The graph contains edges: (1, 4), (1, 2), (1, 3), (1, 5), (2, 4), (4, 5), (2, 3), (2,... | [(5,1),(5,2),(5,3),(5,4)] | graph_bfs |
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 ... | No | graph_edge_existence |
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 ... | No | graph_edge_existence |
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, and 24. The graph contains edge... | 21.875 | graph_avg_neighbor_degree |
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 di... | 0.4676923076923077 | graph_density |
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, ... | 0.6213349345596119 | graph_adamic_adar_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, 6, 7, 8, 9,... | No | graph_is_strongly_connected |
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... | -0.18999999999999584 | graph_degree_assortativity |
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, 2... | [20,10,9,1,3,15,21,5,4,22,24,26,25] | graph_shortest_path |
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... | 0.8350694444444444 | graph_constraint |
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 ... | 46.0 | graph_wiener_index |
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 ... | 0 | graph_resource_allocation_index |
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, ... | 0.004032258064516128 | graph_betweenness_centrality |
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, ... | 2 | graph_connected_component_number |
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:... | 13 | graph_strongly_connected_number |
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... | 0.4444444444444444 | graph_jaccard_coefficient |
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,... | 0.37714285714285717 | graph_transitivity |
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 ... | 2 | graph_weakly_connected_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... | [(1,5),(4,3),(6,1),(10,9),(11,12),(13,7),(14,8),(15,2),(18,16),(19,17)] | graph_min_edge_covering |
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... | [1,2,3,4,5,6,7,8,9,11,12,15,16,17,18,19,24,25] | graph_min_vertex_cover |
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,... | [2] | graph_barycenter |
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, 4), (1, 2), (1, 5), (3, 4).
Question: Does the graph have a cycle?
Your answer should be Yes or N... | No | graph_has_cycle |
The task is to find all bridges of a graph.
A bridge is an edge in a graph whose removal increases the number of connected components.
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, 1... | [(1,10),(1,18),(2,18),(2,19),(3,5),(3,14),(5,10),(6,7),(7,11),(9,12),(11,15),(12,15),(13,16),(14,17),(16,21),(17,20)] | graph_bridges |
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 ... | 0 | graph_resource_allocation_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, and 6. The graph co... | 0.5 | graph_transitivity |
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, ... | [10] | graph_center |
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, a... | 4 | graph_diameter |
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, and 15. The graph contains edges: (2, 15), (15, 11), (3, 9), (9, 8)... | [7,10,12,13,2,14,4,15,1,11,5,3,9,8,6] | graph_topological_sort |
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, ... | [1,3] | graph_periphery |
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,... | 0.5117647058823529 | graph_transitivity |
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 an... | [(1,2),(1,6),(2,3),(2,4),(2,5),(3,7),(5,8),(6,27),(9,10),(10,11),(10,12),(11,13),(11,14),(11,15),(11,17),(14,26),(16,18),(18,25),(19,20),(19,21),(19,22),(21,24),(21,25),(21,27),(23,24)] | graph_minimum_spanning_tree |
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, ... | 1.4426950408889634 | graph_adamic_adar_index |
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... | [(1,17),(3,19),(5,10),(7,4),(8,12),(11,20),(14,21),(15,13),(16,2),(18,9),(22,6)] | graph_min_edge_covering |
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,... | [5] | graph_barycenter |
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 ... | 0 | graph_resource_allocation_index |
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 ... | No | graph_edge_existence |
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, ... | [5] | graph_center |
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,... | 2 | graph_degree |
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, and 18. The graph contains edges: (1, 18), (1, 5), (1, 6), (1, 4),... | [3,7,10,12,13,15,16] | graph_common_neighbor |
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, ... | 0.018518518518518517 | graph_betweenness_centrality |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.