GraphOmni: A Comprehensive and Extendable Benchmark Framework for Large Language Models on Graph-theoretic Tasks
Paper β’ 2504.12764 β’ Published β’ 42
difficulty stringclasses 3
values | graph_info stringclasses 220
values | graph_token stringlengths 2 4 | graph_type stringclasses 5
values | gt_answer stringclasses 375
values | name-id stringlengths 31 60 | prompt_type stringclasses 9
values | query stringlengths 134 15.8k | serialization_type stringclasses 7
values | task_type stringclasses 1
value |
|---|---|---|---|---|---|---|---|---|---|
easy | [[0 1 1 1 1 0 0 0 0]
[1 0 0 0 0 1 0 0 1]
[1 0 0 0 0 0 0 0 1]
[1 0 0 0 0 0 0 0 1]
[1 0 0 0 0 0 0 0 1]
[0 1 0 0 0 0 1 1 0]
[0 0 0 0 0 1 0 0 1]
[0 0 0 0 0 1 0 0 0]
[0 1 1 1 1 0 1 0 0]] | 1444 | Bipartite-ERP | [True, [4, 1]] | connectivity-easy-Algorithm-Graph Modelling Language-0 | Algorithm | To determine if there is a path between two nodes in an undirected graph, we can use a Breadth-First Search (BFS) algorithm.
BFS is an algorithm that starts at one node and explores all of its neighbors before moving on to the next level of neighbors.
By exploring each node in the graph, the algorithm can determine if ... | Graph Modelling Language | connectivity |
easy | [[0 1 1 1 1 0 0 0 0]
[1 0 0 0 0 1 0 0 1]
[1 0 0 0 0 0 0 0 1]
[1 0 0 0 0 0 0 0 1]
[1 0 0 0 0 0 0 0 1]
[0 1 0 0 0 0 1 1 0]
[0 0 0 0 0 1 0 0 1]
[0 0 0 0 0 1 0 0 0]
[0 1 1 1 1 0 1 0 0]] | 1444 | Bipartite-ERP | [True, [2, 4]] | connectivity-easy-Algorithm-Graph Modelling Language-1 | Algorithm | To determine if there is a path between two nodes in an undirected graph, we can use a Breadth-First Search (BFS) algorithm.
BFS is an algorithm that starts at one node and explores all of its neighbors before moving on to the next level of neighbors.
By exploring each node in the graph, the algorithm can determine if ... | Graph Modelling Language | connectivity |
easy | [[0 1 1 1 1 0 0 0 0]
[1 0 0 0 0 1 0 0 1]
[1 0 0 0 0 0 0 0 1]
[1 0 0 0 0 0 0 0 1]
[1 0 0 0 0 0 0 0 1]
[0 1 0 0 0 0 1 1 0]
[0 0 0 0 0 1 0 0 1]
[0 0 0 0 0 1 0 0 0]
[0 1 1 1 1 0 1 0 0]] | 1444 | Bipartite-ERP | [True, [4, 2]] | connectivity-easy-Algorithm-Graph Modelling Language-2 | Algorithm | To determine if there is a path between two nodes in an undirected graph, we can use a Breadth-First Search (BFS) algorithm.
BFS is an algorithm that starts at one node and explores all of its neighbors before moving on to the next level of neighbors.
By exploring each node in the graph, the algorithm can determine if ... | Graph Modelling Language | connectivity |
easy | [[0 1 1 1 1 0 0 0 0]
[1 0 0 0 0 1 0 0 1]
[1 0 0 0 0 0 0 0 1]
[1 0 0 0 0 0 0 0 1]
[1 0 0 0 0 0 0 0 1]
[0 1 0 0 0 0 1 1 0]
[0 0 0 0 0 1 0 0 1]
[0 0 0 0 0 1 0 0 0]
[0 1 1 1 1 0 1 0 0]] | 1444 | Bipartite-ERP | [True, [1, 2]] | connectivity-easy-Algorithm-Graph Modelling Language-3 | Algorithm | To determine if there is a path between two nodes in an undirected graph, we can use a Breadth-First Search (BFS) algorithm.
BFS is an algorithm that starts at one node and explores all of its neighbors before moving on to the next level of neighbors.
By exploring each node in the graph, the algorithm can determine if ... | Graph Modelling Language | connectivity |
easy | [[0 1 0 0 0 0]
[1 0 0 0 1 1]
[0 0 0 1 0 0]
[0 0 1 0 1 1]
[0 1 0 1 0 0]
[0 1 0 1 0 0]] | 1375 | Bipartite-ERP | [False, [3, 0]] | connectivity-easy-Algorithm-Graph Modelling Language-4 | Algorithm | To determine if there is a path between two nodes in an undirected graph, we can use a Breadth-First Search (BFS) algorithm.
BFS is an algorithm that starts at one node and explores all of its neighbors before moving on to the next level of neighbors.
By exploring each node in the graph, the algorithm can determine if ... | Graph Modelling Language | connectivity |
easy | [[0 1 0 0 0 0]
[1 0 0 0 1 1]
[0 0 0 1 0 0]
[0 0 1 0 1 1]
[0 1 0 1 0 0]
[0 1 0 1 0 0]] | 1375 | Bipartite-ERP | [False, [1, 0]] | connectivity-easy-Algorithm-Graph Modelling Language-5 | Algorithm | To determine if there is a path between two nodes in an undirected graph, we can use a Breadth-First Search (BFS) algorithm.
BFS is an algorithm that starts at one node and explores all of its neighbors before moving on to the next level of neighbors.
By exploring each node in the graph, the algorithm can determine if ... | Graph Modelling Language | connectivity |
easy | [[0 1 0 0 0 0]
[1 0 0 0 1 1]
[0 0 0 1 0 0]
[0 0 1 0 1 1]
[0 1 0 1 0 0]
[0 1 0 1 0 0]] | 1375 | Bipartite-ERP | [False, [6, 0]] | connectivity-easy-Algorithm-Graph Modelling Language-6 | Algorithm | To determine if there is a path between two nodes in an undirected graph, we can use a Breadth-First Search (BFS) algorithm.
BFS is an algorithm that starts at one node and explores all of its neighbors before moving on to the next level of neighbors.
By exploring each node in the graph, the algorithm can determine if ... | Graph Modelling Language | connectivity |
easy | [[0 1 0 0 0 0 0]
[1 0 0 0 0 1 0]
[0 0 0 1 0 0 0]
[0 0 1 0 1 0 0]
[0 0 0 1 0 0 0]
[0 1 0 0 0 0 1]
[0 0 0 0 0 1 0]] | 1377 | Bipartite-ERP | [False, [4, 1]] | connectivity-easy-Algorithm-Graph Modelling Language-7 | Algorithm | To determine if there is a path between two nodes in an undirected graph, we can use a Breadth-First Search (BFS) algorithm.
BFS is an algorithm that starts at one node and explores all of its neighbors before moving on to the next level of neighbors.
By exploring each node in the graph, the algorithm can determine if ... | Graph Modelling Language | connectivity |
easy | [[0 1 0 0 0 0 0]
[1 0 0 0 0 1 0]
[0 0 0 1 0 0 0]
[0 0 1 0 1 0 0]
[0 0 0 1 0 0 0]
[0 1 0 0 0 0 1]
[0 0 0 0 0 1 0]] | 1377 | Bipartite-ERP | [False, [1, 6]] | connectivity-easy-Algorithm-Graph Modelling Language-8 | Algorithm | To determine if there is a path between two nodes in an undirected graph, we can use a Breadth-First Search (BFS) algorithm.
BFS is an algorithm that starts at one node and explores all of its neighbors before moving on to the next level of neighbors.
By exploring each node in the graph, the algorithm can determine if ... | Graph Modelling Language | connectivity |
easy | [[0 1 0 0 0 0 0]
[1 0 0 0 0 1 0]
[0 0 0 1 0 0 0]
[0 0 1 0 1 0 0]
[0 0 0 1 0 0 0]
[0 1 0 0 0 0 1]
[0 0 0 0 0 1 0]] | 1377 | Bipartite-ERP | [False, [0, 2]] | connectivity-easy-Algorithm-Graph Modelling Language-9 | Algorithm | To determine if there is a path between two nodes in an undirected graph, we can use a Breadth-First Search (BFS) algorithm.
BFS is an algorithm that starts at one node and explores all of its neighbors before moving on to the next level of neighbors.
By exploring each node in the graph, the algorithm can determine if ... | Graph Modelling Language | connectivity |
easy | [[0 1 0 0 0 0 0]
[1 0 0 0 0 1 0]
[0 0 0 1 0 0 0]
[0 0 1 0 1 0 0]
[0 0 0 1 0 0 0]
[0 1 0 0 0 0 1]
[0 0 0 0 0 1 0]] | 1377 | Bipartite-ERP | [False, [2, 0]] | connectivity-easy-Algorithm-Graph Modelling Language-10 | Algorithm | To determine if there is a path between two nodes in an undirected graph, we can use a Breadth-First Search (BFS) algorithm.
BFS is an algorithm that starts at one node and explores all of its neighbors before moving on to the next level of neighbors.
By exploring each node in the graph, the algorithm can determine if ... | Graph Modelling Language | connectivity |
easy | [[0 1 1 0 0]
[1 0 0 0 0]
[1 0 0 0 0]
[0 0 0 0 1]
[0 0 0 1 0]] | 1345 | Bipartite-ERP | [False, [0, 4]] | connectivity-easy-Algorithm-Graph Modelling Language-15 | Algorithm | To determine if there is a path between two nodes in an undirected graph, we can use a Breadth-First Search (BFS) algorithm.
BFS is an algorithm that starts at one node and explores all of its neighbors before moving on to the next level of neighbors.
By exploring each node in the graph, the algorithm can determine if ... | Graph Modelling Language | connectivity |
easy | [[0 1 1 0 0]
[1 0 0 0 0]
[1 0 0 0 0]
[0 0 0 0 1]
[0 0 0 1 0]] | 1345 | Bipartite-ERP | [False, [2, 4]] | connectivity-easy-Algorithm-Graph Modelling Language-16 | Algorithm | To determine if there is a path between two nodes in an undirected graph, we can use a Breadth-First Search (BFS) algorithm.
BFS is an algorithm that starts at one node and explores all of its neighbors before moving on to the next level of neighbors.
By exploring each node in the graph, the algorithm can determine if ... | Graph Modelling Language | connectivity |
easy | [[0 1 1 0 0]
[1 0 0 0 0]
[1 0 0 0 0]
[0 0 0 0 1]
[0 0 0 1 0]] | 1345 | Bipartite-ERP | [False, [5, 0]] | connectivity-easy-Algorithm-Graph Modelling Language-17 | Algorithm | To determine if there is a path between two nodes in an undirected graph, we can use a Breadth-First Search (BFS) algorithm.
BFS is an algorithm that starts at one node and explores all of its neighbors before moving on to the next level of neighbors.
By exploring each node in the graph, the algorithm can determine if ... | Graph Modelling Language | connectivity |
easy | [[0 1 1 1 0 0 0 0]
[1 0 0 0 0 0 0 0]
[1 0 0 0 0 0 1 0]
[1 0 0 0 0 0 0 1]
[0 0 0 0 0 1 0 0]
[0 0 0 0 1 0 1 0]
[0 0 1 0 0 1 0 0]
[0 0 0 1 0 0 0 0]] | 1400 | Bipartite-ERP | [True, [4, 2]] | connectivity-easy-Algorithm-Graph Modelling Language-19 | Algorithm | To determine if there is a path between two nodes in an undirected graph, we can use a Breadth-First Search (BFS) algorithm.
BFS is an algorithm that starts at one node and explores all of its neighbors before moving on to the next level of neighbors.
By exploring each node in the graph, the algorithm can determine if ... | Graph Modelling Language | connectivity |
easy | [[0 1 1 1 0 0 0 0]
[1 0 0 0 0 0 0 0]
[1 0 0 0 0 0 1 0]
[1 0 0 0 0 0 0 1]
[0 0 0 0 0 1 0 0]
[0 0 0 0 1 0 1 0]
[0 0 1 0 0 1 0 0]
[0 0 0 1 0 0 0 0]] | 1400 | Bipartite-ERP | [True, [3, 0]] | connectivity-easy-Algorithm-Graph Modelling Language-20 | Algorithm | To determine if there is a path between two nodes in an undirected graph, we can use a Breadth-First Search (BFS) algorithm.
BFS is an algorithm that starts at one node and explores all of its neighbors before moving on to the next level of neighbors.
By exploring each node in the graph, the algorithm can determine if ... | Graph Modelling Language | connectivity |
easy | [[0 1 1 1 0 0 0 0]
[1 0 0 0 0 0 0 0]
[1 0 0 0 0 0 1 0]
[1 0 0 0 0 0 0 1]
[0 0 0 0 0 1 0 0]
[0 0 0 0 1 0 1 0]
[0 0 1 0 0 1 0 0]
[0 0 0 1 0 0 0 0]] | 1400 | Bipartite-ERP | [True, [5, 3]] | connectivity-easy-Algorithm-Graph Modelling Language-21 | Algorithm | To determine if there is a path between two nodes in an undirected graph, we can use a Breadth-First Search (BFS) algorithm.
BFS is an algorithm that starts at one node and explores all of its neighbors before moving on to the next level of neighbors.
By exploring each node in the graph, the algorithm can determine if ... | Graph Modelling Language | connectivity |
easy | [[0 1 1 1 0 0 0 0]
[1 0 0 0 0 0 0 0]
[1 0 0 0 0 0 1 0]
[1 0 0 0 0 0 0 1]
[0 0 0 0 0 1 0 0]
[0 0 0 0 1 0 1 0]
[0 0 1 0 0 1 0 0]
[0 0 0 1 0 0 0 0]] | 1400 | Bipartite-ERP | [True, [6, 3]] | connectivity-easy-Algorithm-Graph Modelling Language-22 | Algorithm | To determine if there is a path between two nodes in an undirected graph, we can use a Breadth-First Search (BFS) algorithm.
BFS is an algorithm that starts at one node and explores all of its neighbors before moving on to the next level of neighbors.
By exploring each node in the graph, the algorithm can determine if ... | Graph Modelling Language | connectivity |
easy | [[0 1 1 1 1 0 0 0 0]
[1 0 0 0 0 1 0 1 1]
[1 0 0 0 0 1 0 1 1]
[1 0 0 0 0 0 0 0 1]
[1 0 0 0 0 1 0 0 1]
[0 1 1 0 1 0 1 0 0]
[0 0 0 0 0 1 0 0 0]
[0 1 1 0 0 0 0 0 0]
[0 1 1 1 1 0 0 0 0]] | 1458 | Bipartite-ERP | [True, [6, 3]] | connectivity-easy-Algorithm-Graph Modelling Language-23 | Algorithm | To determine if there is a path between two nodes in an undirected graph, we can use a Breadth-First Search (BFS) algorithm.
BFS is an algorithm that starts at one node and explores all of its neighbors before moving on to the next level of neighbors.
By exploring each node in the graph, the algorithm can determine if ... | Graph Modelling Language | connectivity |
easy | [[0 1 1 1 1 0 0 0 0]
[1 0 0 0 0 1 0 1 1]
[1 0 0 0 0 1 0 1 1]
[1 0 0 0 0 0 0 0 1]
[1 0 0 0 0 1 0 0 1]
[0 1 1 0 1 0 1 0 0]
[0 0 0 0 0 1 0 0 0]
[0 1 1 0 0 0 0 0 0]
[0 1 1 1 1 0 0 0 0]] | 1458 | Bipartite-ERP | [True, [7, 6]] | connectivity-easy-Algorithm-Graph Modelling Language-24 | Algorithm | To determine if there is a path between two nodes in an undirected graph, we can use a Breadth-First Search (BFS) algorithm.
BFS is an algorithm that starts at one node and explores all of its neighbors before moving on to the next level of neighbors.
By exploring each node in the graph, the algorithm can determine if ... | Graph Modelling Language | connectivity |
easy | [[0 1 1 1 1 0 0 0 0]
[1 0 0 0 0 1 0 1 1]
[1 0 0 0 0 1 0 1 1]
[1 0 0 0 0 0 0 0 1]
[1 0 0 0 0 1 0 0 1]
[0 1 1 0 1 0 1 0 0]
[0 0 0 0 0 1 0 0 0]
[0 1 1 0 0 0 0 0 0]
[0 1 1 1 1 0 0 0 0]] | 1458 | Bipartite-ERP | [True, [1, 6]] | connectivity-easy-Algorithm-Graph Modelling Language-25 | Algorithm | To determine if there is a path between two nodes in an undirected graph, we can use a Breadth-First Search (BFS) algorithm.
BFS is an algorithm that starts at one node and explores all of its neighbors before moving on to the next level of neighbors.
By exploring each node in the graph, the algorithm can determine if ... | Graph Modelling Language | connectivity |
easy | [[0 1 1 1 1 0 0 0 0]
[1 0 0 0 0 1 0 1 1]
[1 0 0 0 0 1 0 1 1]
[1 0 0 0 0 0 0 0 1]
[1 0 0 0 0 1 0 0 1]
[0 1 1 0 1 0 1 0 0]
[0 0 0 0 0 1 0 0 0]
[0 1 1 0 0 0 0 0 0]
[0 1 1 1 1 0 0 0 0]] | 1458 | Bipartite-ERP | [True, [0, 1]] | connectivity-easy-Algorithm-Graph Modelling Language-26 | Algorithm | To determine if there is a path between two nodes in an undirected graph, we can use a Breadth-First Search (BFS) algorithm.
BFS is an algorithm that starts at one node and explores all of its neighbors before moving on to the next level of neighbors.
By exploring each node in the graph, the algorithm can determine if ... | Graph Modelling Language | connectivity |
easy | [[0 1 1 1 1 0 0 0]
[1 0 0 0 0 0 0 1]
[1 0 0 0 0 1 1 1]
[1 0 0 0 0 1 1 1]
[1 0 0 0 0 1 1 1]
[0 0 1 1 1 0 0 0]
[0 0 1 1 1 0 0 0]
[0 1 1 1 1 0 0 0]] | 1449 | Bipartite-ERP | [True, [0, 1]] | connectivity-easy-Algorithm-Graph Modelling Language-27 | Algorithm | To determine if there is a path between two nodes in an undirected graph, we can use a Breadth-First Search (BFS) algorithm.
BFS is an algorithm that starts at one node and explores all of its neighbors before moving on to the next level of neighbors.
By exploring each node in the graph, the algorithm can determine if ... | Graph Modelling Language | connectivity |
easy | [[0 1 1 1 1 0 0 0]
[1 0 0 0 0 0 0 1]
[1 0 0 0 0 1 1 1]
[1 0 0 0 0 1 1 1]
[1 0 0 0 0 1 1 1]
[0 0 1 1 1 0 0 0]
[0 0 1 1 1 0 0 0]
[0 1 1 1 1 0 0 0]] | 1449 | Bipartite-ERP | [True, [1, 2]] | connectivity-easy-Algorithm-Graph Modelling Language-28 | Algorithm | To determine if there is a path between two nodes in an undirected graph, we can use a Breadth-First Search (BFS) algorithm.
BFS is an algorithm that starts at one node and explores all of its neighbors before moving on to the next level of neighbors.
By exploring each node in the graph, the algorithm can determine if ... | Graph Modelling Language | connectivity |
easy | [[0 1 1 1 1 0 0 0]
[1 0 0 0 0 0 0 1]
[1 0 0 0 0 1 1 1]
[1 0 0 0 0 1 1 1]
[1 0 0 0 0 1 1 1]
[0 0 1 1 1 0 0 0]
[0 0 1 1 1 0 0 0]
[0 1 1 1 1 0 0 0]] | 1449 | Bipartite-ERP | [True, [4, 6]] | connectivity-easy-Algorithm-Graph Modelling Language-29 | Algorithm | To determine if there is a path between two nodes in an undirected graph, we can use a Breadth-First Search (BFS) algorithm.
BFS is an algorithm that starts at one node and explores all of its neighbors before moving on to the next level of neighbors.
By exploring each node in the graph, the algorithm can determine if ... | Graph Modelling Language | connectivity |
easy | [[0 1 1 1 1 0 0 0]
[1 0 0 0 0 0 0 1]
[1 0 0 0 0 1 1 1]
[1 0 0 0 0 1 1 1]
[1 0 0 0 0 1 1 1]
[0 0 1 1 1 0 0 0]
[0 0 1 1 1 0 0 0]
[0 1 1 1 1 0 0 0]] | 1449 | Bipartite-ERP | [True, [5, 4]] | connectivity-easy-Algorithm-Graph Modelling Language-30 | Algorithm | To determine if there is a path between two nodes in an undirected graph, we can use a Breadth-First Search (BFS) algorithm.
BFS is an algorithm that starts at one node and explores all of its neighbors before moving on to the next level of neighbors.
By exploring each node in the graph, the algorithm can determine if ... | Graph Modelling Language | connectivity |
GraphOmni provides a unified pipeline to evaluate large language models (LLMs) on graph problems. It supports a wide range of models, graph representations, prompt types, and task formulations. The dataset enables automated evaluation and result tracking across different prompting and modeling setups.
Connectivity, Bfsorder, Triangle, Diameter, Cycle, Shortest pathEach entry in the dataset is a Python dictionary with the following fields:
| Field | Description |
|---|---|
name-id |
Unique identifier for the query instance |
query |
The full input query posed to the model |
gt_answer |
Ground-truth answer for the task |
prompt_type |
Prompt format used (e.g., zero-shot, CoT) |
task_type |
One of the six task categories |
serialization_type |
Graph serialization method (e.g., adjacency matrix) |
graph_info |
Graph representation (typically in adjacency matrix format) |
graph_type |
Type of graph (e.g., undirected, DAG) |
graph_token |
Number of tokens in serialized graph |
difficulty |
Estimated difficulty level (e.g., easy, medium, hard) |
You can load and convert any task split into a list format using the Hugging Face datasets library:
from datasets import load_dataset
# Load a specific task split (e.g., 'connectivity')
dataset = load_dataset("G-A-I/GraphOmni", split="connectivity")
# Convert the first 3 examples to a list of dictionaries
examples = dataset.select(range(3)).to_list()
for ex in examples:
print(ex)