Dataset Preview
The full dataset viewer is not available (click to read why). Only showing a preview of the rows.
The dataset generation failed
Error code: DatasetGenerationError
Exception: TypeError
Message: Couldn't cast array of type
struct<1: int64, 2: int64, 3: int64, 4: int64, 5: int64>
to
{'1': Value('int64'), '2': Value('int64'), '3': Value('int64'), '4': Value('int64')}
Traceback: Traceback (most recent call last):
File "/usr/local/lib/python3.12/site-packages/datasets/builder.py", line 1887, in _prepare_split_single
writer.write_table(table)
File "/usr/local/lib/python3.12/site-packages/datasets/arrow_writer.py", line 675, in write_table
pa_table = table_cast(pa_table, self._schema)
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
File "/usr/local/lib/python3.12/site-packages/datasets/table.py", line 2272, in table_cast
return cast_table_to_schema(table, schema)
^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
File "/usr/local/lib/python3.12/site-packages/datasets/table.py", line 2224, in cast_table_to_schema
cast_array_to_feature(
File "/usr/local/lib/python3.12/site-packages/datasets/table.py", line 1795, in wrapper
return pa.chunked_array([func(chunk, *args, **kwargs) for chunk in array.chunks])
^^^^^^^^^^^^^^^^^^^^^^^^^^^^
File "/usr/local/lib/python3.12/site-packages/datasets/table.py", line 2002, in cast_array_to_feature
_c(array.field(name) if name in array_fields else null_array, subfeature)
File "/usr/local/lib/python3.12/site-packages/datasets/table.py", line 1797, in wrapper
return func(array, *args, **kwargs)
^^^^^^^^^^^^^^^^^^^^^^^^^^^^
File "/usr/local/lib/python3.12/site-packages/datasets/table.py", line 2092, in cast_array_to_feature
raise TypeError(f"Couldn't cast array of type\n{_short_str(array.type)}\nto\n{_short_str(feature)}")
TypeError: Couldn't cast array of type
struct<1: int64, 2: int64, 3: int64, 4: int64, 5: int64>
to
{'1': Value('int64'), '2': Value('int64'), '3': Value('int64'), '4': Value('int64')}
The above exception was the direct cause of the following exception:
Traceback (most recent call last):
File "/src/services/worker/src/worker/job_runners/config/parquet_and_info.py", line 1347, in compute_config_parquet_and_info_response
parquet_operations = convert_to_parquet(builder)
^^^^^^^^^^^^^^^^^^^^^^^^^^^
File "/src/services/worker/src/worker/job_runners/config/parquet_and_info.py", line 980, in convert_to_parquet
builder.download_and_prepare(
File "/usr/local/lib/python3.12/site-packages/datasets/builder.py", line 884, in download_and_prepare
self._download_and_prepare(
File "/usr/local/lib/python3.12/site-packages/datasets/builder.py", line 947, in _download_and_prepare
self._prepare_split(split_generator, **prepare_split_kwargs)
File "/usr/local/lib/python3.12/site-packages/datasets/builder.py", line 1736, in _prepare_split
for job_id, done, content in self._prepare_split_single(
^^^^^^^^^^^^^^^^^^^^^^^^^^^
File "/usr/local/lib/python3.12/site-packages/datasets/builder.py", line 1919, in _prepare_split_single
raise DatasetGenerationError("An error occurred while generating the dataset") from e
datasets.exceptions.DatasetGenerationError: An error occurred while generating the datasetNeed help to make the dataset viewer work? Make sure to review how to configure the dataset viewer, and open a discussion for direct support.
answer string | difficulty int64 | metadata dict | question string |
|---|---|---|---|
1->3, 2->1, 3->4, 4->2 | 3 | {
"g1_edges": [
[
2,
4
]
],
"g2_edges": [
[
1,
2
]
],
"ground_truth_perm": {
"1": 3,
"2": 1,
"3": 4,
"4": 2
},
"is_isomorphic": true,
"n_nodes": 4
} | You are given two graphs G1 and G2. Your task is to determine whether they are isomorphic.
Two graphs are isomorphic if there exists a one-to-one mapping (bijection) between their vertex sets that preserves edges. That is, if vertex u is connected to vertex v in G1, then the mapped vertices must also be connected in G... |
1->1, 2->2, 3->4, 4->3 | 3 | {
"g1_edges": [
[
1,
2
],
[
1,
3
],
[
1,
4
]
],
"g2_edges": [
[
1,
2
],
[
1,
3
],
[
1,
4
]
],
"ground_truth_perm": {
"1": 1,
"2": 2,
"3": 4,
"4": 3
},
"is_isomorphic": tr... | You are given two graphs G1 and G2. Your task is to determine whether they are isomorphic.
Two graphs are isomorphic if there exists a one-to-one mapping (bijection) between their vertex sets that preserves edges. That is, if vertex u is connected to vertex v in G1, then the mapped vertices must also be connected in G... |
1->4, 2->3, 3->1, 4->2 | 3 | {
"g1_edges": [
[
1,
4
],
[
2,
4
],
[
3,
4
]
],
"g2_edges": [
[
1,
2
],
[
2,
3
],
[
2,
4
]
],
"ground_truth_perm": {
"1": 4,
"2": 3,
"3": 1,
"4": 2
},
"is_isomorphic": tr... | You are given two graphs G1 and G2. Your task is to determine whether they are isomorphic.
Two graphs are isomorphic if there exists a one-to-one mapping (bijection) between their vertex sets that preserves edges. That is, if vertex u is connected to vertex v in G1, then the mapped vertices must also be connected in G... |
1->4, 2->3, 3->2, 4->1 | 3 | {
"g1_edges": [
[
1,
2
],
[
1,
4
],
[
2,
3
],
[
3,
4
]
],
"g2_edges": [
[
1,
2
],
[
1,
4
],
[
2,
3
],
[
3,
4
]
],
"ground_truth_perm": {
"1": 4,
... | You are given two graphs G1 and G2. Your task is to determine whether they are isomorphic.
Two graphs are isomorphic if there exists a one-to-one mapping (bijection) between their vertex sets that preserves edges. That is, if vertex u is connected to vertex v in G1, then the mapped vertices must also be connected in G... |
1->4, 2->2, 3->1, 4->3 | 3 | {
"g1_edges": [
[
1,
4
]
],
"g2_edges": [
[
3,
4
]
],
"ground_truth_perm": {
"1": 4,
"2": 2,
"3": 1,
"4": 3
},
"is_isomorphic": true,
"n_nodes": 4
} | You are given two graphs G1 and G2. Your task is to determine whether they are isomorphic.
Two graphs are isomorphic if there exists a one-to-one mapping (bijection) between their vertex sets that preserves edges. That is, if vertex u is connected to vertex v in G1, then the mapped vertices must also be connected in G... |
1->3, 2->2, 3->4, 4->1 | 3 | {
"g1_edges": [
[
1,
3
],
[
1,
4
],
[
2,
3
],
[
3,
4
]
],
"g2_edges": [
[
1,
3
],
[
1,
4
],
[
2,
4
],
[
3,
4
]
],
"ground_truth_perm": {
"1": 3,
... | You are given two graphs G1 and G2. Your task is to determine whether they are isomorphic.
Two graphs are isomorphic if there exists a one-to-one mapping (bijection) between their vertex sets that preserves edges. That is, if vertex u is connected to vertex v in G1, then the mapped vertices must also be connected in G... |
1->3, 2->2, 3->1, 4->4 | 3 | {
"g1_edges": [
[
3,
4
]
],
"g2_edges": [
[
1,
4
]
],
"ground_truth_perm": {
"1": 3,
"2": 2,
"3": 1,
"4": 4
},
"is_isomorphic": true,
"n_nodes": 4
} | You are given two graphs G1 and G2. Your task is to determine whether they are isomorphic.
Two graphs are isomorphic if there exists a one-to-one mapping (bijection) between their vertex sets that preserves edges. That is, if vertex u is connected to vertex v in G1, then the mapped vertices must also be connected in G... |
1->4, 2->3, 3->1, 4->2 | 3 | {
"g1_edges": [
[
1,
2
],
[
1,
3
],
[
1,
4
],
[
2,
3
],
[
2,
4
],
[
3,
4
]
],
"g2_edges": [
[
1,
2
],
[
1,
3
],
[
1,
4
],
[
... | You are given two graphs G1 and G2. Your task is to determine whether they are isomorphic.
Two graphs are isomorphic if there exists a one-to-one mapping (bijection) between their vertex sets that preserves edges. That is, if vertex u is connected to vertex v in G1, then the mapped vertices must also be connected in G... |
1->3, 2->4, 3->2, 4->1 | 3 | {
"g1_edges": [
[
1,
2
],
[
1,
3
],
[
2,
3
],
[
3,
4
]
],
"g2_edges": [
[
1,
2
],
[
2,
3
],
[
2,
4
],
[
3,
4
]
],
"ground_truth_perm": {
"1": 3,
... | You are given two graphs G1 and G2. Your task is to determine whether they are isomorphic.
Two graphs are isomorphic if there exists a one-to-one mapping (bijection) between their vertex sets that preserves edges. That is, if vertex u is connected to vertex v in G1, then the mapped vertices must also be connected in G... |
1->2, 2->1, 3->3, 4->4 | 3 | {
"g1_edges": [
[
1,
2
],
[
1,
4
],
[
2,
3
],
[
2,
4
]
],
"g2_edges": [
[
1,
2
],
[
1,
3
],
[
1,
4
],
[
2,
4
]
],
"ground_truth_perm": {
"1": 2,
... | You are given two graphs G1 and G2. Your task is to determine whether they are isomorphic.
Two graphs are isomorphic if there exists a one-to-one mapping (bijection) between their vertex sets that preserves edges. That is, if vertex u is connected to vertex v in G1, then the mapped vertices must also be connected in G... |
1->4, 2->1, 3->3, 4->2 | 3 | {
"g1_edges": [
[
2,
3
],
[
3,
4
]
],
"g2_edges": [
[
1,
3
],
[
2,
3
]
],
"ground_truth_perm": {
"1": 4,
"2": 1,
"3": 3,
"4": 2
},
"is_isomorphic": true,
"n_nodes": 4
} | You are given two graphs G1 and G2. Your task is to determine whether they are isomorphic.
Two graphs are isomorphic if there exists a one-to-one mapping (bijection) between their vertex sets that preserves edges. That is, if vertex u is connected to vertex v in G1, then the mapped vertices must also be connected in G... |
1->4, 2->2, 3->3, 4->1 | 3 | {
"g1_edges": [
[
1,
3
],
[
1,
4
],
[
2,
3
]
],
"g2_edges": [
[
1,
4
],
[
2,
3
],
[
3,
4
]
],
"ground_truth_perm": {
"1": 4,
"2": 2,
"3": 3,
"4": 1
},
"is_isomorphic": tr... | You are given two graphs G1 and G2. Your task is to determine whether they are isomorphic.
Two graphs are isomorphic if there exists a one-to-one mapping (bijection) between their vertex sets that preserves edges. That is, if vertex u is connected to vertex v in G1, then the mapped vertices must also be connected in G... |
1->4, 2->1, 3->3, 4->2 | 3 | {
"g1_edges": [
[
1,
2
],
[
2,
3
]
],
"g2_edges": [
[
1,
3
],
[
1,
4
]
],
"ground_truth_perm": {
"1": 4,
"2": 1,
"3": 3,
"4": 2
},
"is_isomorphic": true,
"n_nodes": 4
} | You are given two graphs G1 and G2. Your task is to determine whether they are isomorphic.
Two graphs are isomorphic if there exists a one-to-one mapping (bijection) between their vertex sets that preserves edges. That is, if vertex u is connected to vertex v in G1, then the mapped vertices must also be connected in G... |
1->3, 2->1, 3->2, 4->4 | 3 | {
"g1_edges": [
[
1,
3
],
[
1,
4
],
[
3,
4
]
],
"g2_edges": [
[
2,
3
],
[
2,
4
],
[
3,
4
]
],
"ground_truth_perm": {
"1": 3,
"2": 1,
"3": 2,
"4": 4
},
"is_isomorphic": tr... | You are given two graphs G1 and G2. Your task is to determine whether they are isomorphic.
Two graphs are isomorphic if there exists a one-to-one mapping (bijection) between their vertex sets that preserves edges. That is, if vertex u is connected to vertex v in G1, then the mapped vertices must also be connected in G... |
1->3, 2->4, 3->2, 4->1 | 3 | {
"g1_edges": [
[
1,
4
],
[
2,
3
],
[
2,
4
]
],
"g2_edges": [
[
1,
3
],
[
1,
4
],
[
2,
4
]
],
"ground_truth_perm": {
"1": 3,
"2": 4,
"3": 2,
"4": 1
},
"is_isomorphic": tr... | You are given two graphs G1 and G2. Your task is to determine whether they are isomorphic.
Two graphs are isomorphic if there exists a one-to-one mapping (bijection) between their vertex sets that preserves edges. That is, if vertex u is connected to vertex v in G1, then the mapped vertices must also be connected in G... |
1->3, 2->2, 3->4, 4->1 | 3 | {
"g1_edges": [
[
1,
2
],
[
1,
3
],
[
1,
4
],
[
2,
3
],
[
2,
4
]
],
"g2_edges": [
[
1,
2
],
[
1,
3
],
[
2,
3
],
[
2,
4
],
[
... | You are given two graphs G1 and G2. Your task is to determine whether they are isomorphic.
Two graphs are isomorphic if there exists a one-to-one mapping (bijection) between their vertex sets that preserves edges. That is, if vertex u is connected to vertex v in G1, then the mapped vertices must also be connected in G... |
1->1, 2->2, 3->4, 4->3 | 3 | {
"g1_edges": [
[
1,
3
],
[
2,
3
]
],
"g2_edges": [
[
1,
4
],
[
2,
4
]
],
"ground_truth_perm": {
"1": 1,
"2": 2,
"3": 4,
"4": 3
},
"is_isomorphic": true,
"n_nodes": 4
} | You are given two graphs G1 and G2. Your task is to determine whether they are isomorphic.
Two graphs are isomorphic if there exists a one-to-one mapping (bijection) between their vertex sets that preserves edges. That is, if vertex u is connected to vertex v in G1, then the mapped vertices must also be connected in G... |
1->2, 2->4, 3->3, 4->1 | 3 | {
"g1_edges": [
[
1,
3
],
[
1,
4
],
[
2,
3
]
],
"g2_edges": [
[
1,
2
],
[
2,
3
],
[
3,
4
]
],
"ground_truth_perm": {
"1": 2,
"2": 4,
"3": 3,
"4": 1
},
"is_isomorphic": tr... | You are given two graphs G1 and G2. Your task is to determine whether they are isomorphic.
Two graphs are isomorphic if there exists a one-to-one mapping (bijection) between their vertex sets that preserves edges. That is, if vertex u is connected to vertex v in G1, then the mapped vertices must also be connected in G... |
1->3, 2->4, 3->2, 4->1 | 3 | {
"g1_edges": [
[
1,
2
],
[
1,
3
],
[
2,
3
],
[
2,
4
]
],
"g2_edges": [
[
1,
4
],
[
2,
3
],
[
2,
4
],
[
3,
4
]
],
"ground_truth_perm": {
"1": 3,
... | You are given two graphs G1 and G2. Your task is to determine whether they are isomorphic.
Two graphs are isomorphic if there exists a one-to-one mapping (bijection) between their vertex sets that preserves edges. That is, if vertex u is connected to vertex v in G1, then the mapped vertices must also be connected in G... |
1->4, 2->2, 3->1, 4->3 | 3 | {
"g1_edges": [
[
1,
4
],
[
2,
3
],
[
2,
4
],
[
3,
4
]
],
"g2_edges": [
[
1,
2
],
[
1,
3
],
[
2,
3
],
[
3,
4
]
],
"ground_truth_perm": {
"1": 4,
... | You are given two graphs G1 and G2. Your task is to determine whether they are isomorphic.
Two graphs are isomorphic if there exists a one-to-one mapping (bijection) between their vertex sets that preserves edges. That is, if vertex u is connected to vertex v in G1, then the mapped vertices must also be connected in G... |
1->1, 2->2, 3->4, 4->3 | 3 | {
"g1_edges": [
[
1,
2
],
[
2,
3
],
[
2,
4
],
[
3,
4
]
],
"g2_edges": [
[
1,
2
],
[
2,
3
],
[
2,
4
],
[
3,
4
]
],
"ground_truth_perm": {
"1": 1,
... | You are given two graphs G1 and G2. Your task is to determine whether they are isomorphic.
Two graphs are isomorphic if there exists a one-to-one mapping (bijection) between their vertex sets that preserves edges. That is, if vertex u is connected to vertex v in G1, then the mapped vertices must also be connected in G... |
1->2, 2->1, 3->4, 4->3 | 3 | {
"g1_edges": [
[
1,
3
],
[
2,
4
]
],
"g2_edges": [
[
1,
3
],
[
2,
4
]
],
"ground_truth_perm": {
"1": 2,
"2": 1,
"3": 4,
"4": 3
},
"is_isomorphic": true,
"n_nodes": 4
} | You are given two graphs G1 and G2. Your task is to determine whether they are isomorphic.
Two graphs are isomorphic if there exists a one-to-one mapping (bijection) between their vertex sets that preserves edges. That is, if vertex u is connected to vertex v in G1, then the mapped vertices must also be connected in G... |
1->3, 2->2, 3->4, 4->1 | 3 | {
"g1_edges": [
[
1,
2
],
[
2,
4
]
],
"g2_edges": [
[
1,
2
],
[
2,
3
]
],
"ground_truth_perm": {
"1": 3,
"2": 2,
"3": 4,
"4": 1
},
"is_isomorphic": true,
"n_nodes": 4
} | You are given two graphs G1 and G2. Your task is to determine whether they are isomorphic.
Two graphs are isomorphic if there exists a one-to-one mapping (bijection) between their vertex sets that preserves edges. That is, if vertex u is connected to vertex v in G1, then the mapped vertices must also be connected in G... |
1->4, 2->1, 3->3, 4->2 | 3 | {
"g1_edges": [
[
1,
3
],
[
2,
4
]
],
"g2_edges": [
[
1,
2
],
[
3,
4
]
],
"ground_truth_perm": {
"1": 4,
"2": 1,
"3": 3,
"4": 2
},
"is_isomorphic": true,
"n_nodes": 4
} | You are given two graphs G1 and G2. Your task is to determine whether they are isomorphic.
Two graphs are isomorphic if there exists a one-to-one mapping (bijection) between their vertex sets that preserves edges. That is, if vertex u is connected to vertex v in G1, then the mapped vertices must also be connected in G... |
1->1, 2->4, 3->2, 4->3 | 3 | {
"g1_edges": [
[
1,
4
],
[
2,
3
],
[
3,
4
]
],
"g2_edges": [
[
1,
3
],
[
2,
3
],
[
2,
4
]
],
"ground_truth_perm": {
"1": 1,
"2": 4,
"3": 2,
"4": 3
},
"is_isomorphic": tr... | You are given two graphs G1 and G2. Your task is to determine whether they are isomorphic.
Two graphs are isomorphic if there exists a one-to-one mapping (bijection) between their vertex sets that preserves edges. That is, if vertex u is connected to vertex v in G1, then the mapped vertices must also be connected in G... |
1->2, 2->1, 3->4, 4->3 | 3 | {
"g1_edges": [
[
1,
2
],
[
1,
3
],
[
1,
4
],
[
2,
3
],
[
2,
4
]
],
"g2_edges": [
[
1,
2
],
[
1,
3
],
[
1,
4
],
[
2,
3
],
[
... | You are given two graphs G1 and G2. Your task is to determine whether they are isomorphic.
Two graphs are isomorphic if there exists a one-to-one mapping (bijection) between their vertex sets that preserves edges. That is, if vertex u is connected to vertex v in G1, then the mapped vertices must also be connected in G... |
1->3, 2->2, 3->1, 4->4 | 3 | {
"g1_edges": [
[
1,
4
],
[
2,
3
],
[
2,
4
]
],
"g2_edges": [
[
1,
2
],
[
2,
4
],
[
3,
4
]
],
"ground_truth_perm": {
"1": 3,
"2": 2,
"3": 1,
"4": 4
},
"is_isomorphic": tr... | You are given two graphs G1 and G2. Your task is to determine whether they are isomorphic.
Two graphs are isomorphic if there exists a one-to-one mapping (bijection) between their vertex sets that preserves edges. That is, if vertex u is connected to vertex v in G1, then the mapped vertices must also be connected in G... |
1->2, 2->3, 3->4, 4->1 | 3 | {
"g1_edges": [
[
1,
2
],
[
1,
3
],
[
1,
4
],
[
2,
3
]
],
"g2_edges": [
[
1,
2
],
[
2,
3
],
[
2,
4
],
[
3,
4
]
],
"ground_truth_perm": {
"1": 2,
... | You are given two graphs G1 and G2. Your task is to determine whether they are isomorphic.
Two graphs are isomorphic if there exists a one-to-one mapping (bijection) between their vertex sets that preserves edges. That is, if vertex u is connected to vertex v in G1, then the mapped vertices must also be connected in G... |
1->4, 2->2, 3->1, 4->3 | 3 | {
"g1_edges": [
[
1,
2
],
[
1,
3
],
[
2,
3
]
],
"g2_edges": [
[
1,
2
],
[
1,
4
],
[
2,
4
]
],
"ground_truth_perm": {
"1": 4,
"2": 2,
"3": 1,
"4": 3
},
"is_isomorphic": tr... | You are given two graphs G1 and G2. Your task is to determine whether they are isomorphic.
Two graphs are isomorphic if there exists a one-to-one mapping (bijection) between their vertex sets that preserves edges. That is, if vertex u is connected to vertex v in G1, then the mapped vertices must also be connected in G... |
1->2, 2->1, 3->3, 4->4 | 3 | {
"g1_edges": [
[
1,
2
],
[
1,
4
],
[
2,
4
]
],
"g2_edges": [
[
1,
2
],
[
1,
4
],
[
2,
4
]
],
"ground_truth_perm": {
"1": 2,
"2": 1,
"3": 3,
"4": 4
},
"is_isomorphic": tr... | You are given two graphs G1 and G2. Your task is to determine whether they are isomorphic.
Two graphs are isomorphic if there exists a one-to-one mapping (bijection) between their vertex sets that preserves edges. That is, if vertex u is connected to vertex v in G1, then the mapped vertices must also be connected in G... |
1->3, 2->4, 3->1, 4->2 | 3 | {
"g1_edges": [
[
1,
2
],
[
1,
4
],
[
2,
4
],
[
3,
4
]
],
"g2_edges": [
[
1,
2
],
[
2,
3
],
[
2,
4
],
[
3,
4
]
],
"ground_truth_perm": {
"1": 3,
... | You are given two graphs G1 and G2. Your task is to determine whether they are isomorphic.
Two graphs are isomorphic if there exists a one-to-one mapping (bijection) between their vertex sets that preserves edges. That is, if vertex u is connected to vertex v in G1, then the mapped vertices must also be connected in G... |
1->4, 2->1, 3->2, 4->3 | 3 | {
"g1_edges": [
[
1,
4
],
[
3,
4
]
],
"g2_edges": [
[
2,
3
],
[
3,
4
]
],
"ground_truth_perm": {
"1": 4,
"2": 1,
"3": 2,
"4": 3
},
"is_isomorphic": true,
"n_nodes": 4
} | You are given two graphs G1 and G2. Your task is to determine whether they are isomorphic.
Two graphs are isomorphic if there exists a one-to-one mapping (bijection) between their vertex sets that preserves edges. That is, if vertex u is connected to vertex v in G1, then the mapped vertices must also be connected in G... |
1->2, 2->3, 3->4, 4->1 | 3 | {
"g1_edges": [
[
1,
3
],
[
1,
4
],
[
2,
3
],
[
2,
4
]
],
"g2_edges": [
[
1,
2
],
[
1,
3
],
[
2,
4
],
[
3,
4
]
],
"ground_truth_perm": {
"1": 2,
... | You are given two graphs G1 and G2. Your task is to determine whether they are isomorphic.
Two graphs are isomorphic if there exists a one-to-one mapping (bijection) between their vertex sets that preserves edges. That is, if vertex u is connected to vertex v in G1, then the mapped vertices must also be connected in G... |
1->3, 2->1, 3->4, 4->2 | 3 | {
"g1_edges": [
[
1,
3
],
[
1,
4
],
[
3,
4
]
],
"g2_edges": [
[
2,
3
],
[
2,
4
],
[
3,
4
]
],
"ground_truth_perm": {
"1": 3,
"2": 1,
"3": 4,
"4": 2
},
"is_isomorphic": tr... | You are given two graphs G1 and G2. Your task is to determine whether they are isomorphic.
Two graphs are isomorphic if there exists a one-to-one mapping (bijection) between their vertex sets that preserves edges. That is, if vertex u is connected to vertex v in G1, then the mapped vertices must also be connected in G... |
1->3, 2->2, 3->4, 4->1 | 3 | {
"g1_edges": [
[
1,
3
],
[
1,
4
],
[
3,
4
]
],
"g2_edges": [
[
1,
3
],
[
1,
4
],
[
3,
4
]
],
"ground_truth_perm": {
"1": 3,
"2": 2,
"3": 4,
"4": 1
},
"is_isomorphic": tr... | You are given two graphs G1 and G2. Your task is to determine whether they are isomorphic.
Two graphs are isomorphic if there exists a one-to-one mapping (bijection) between their vertex sets that preserves edges. That is, if vertex u is connected to vertex v in G1, then the mapped vertices must also be connected in G... |
1->2, 2->1, 3->4, 4->3 | 3 | {
"g1_edges": [
[
1,
3
],
[
2,
3
],
[
3,
4
]
],
"g2_edges": [
[
1,
4
],
[
2,
4
],
[
3,
4
]
],
"ground_truth_perm": {
"1": 2,
"2": 1,
"3": 4,
"4": 3
},
"is_isomorphic": tr... | You are given two graphs G1 and G2. Your task is to determine whether they are isomorphic.
Two graphs are isomorphic if there exists a one-to-one mapping (bijection) between their vertex sets that preserves edges. That is, if vertex u is connected to vertex v in G1, then the mapped vertices must also be connected in G... |
1->2, 2->4, 3->1, 4->3 | 3 | {
"g1_edges": [
[
1,
2
],
[
1,
3
],
[
3,
4
]
],
"g2_edges": [
[
1,
2
],
[
1,
3
],
[
2,
4
]
],
"ground_truth_perm": {
"1": 2,
"2": 4,
"3": 1,
"4": 3
},
"is_isomorphic": tr... | You are given two graphs G1 and G2. Your task is to determine whether they are isomorphic.
Two graphs are isomorphic if there exists a one-to-one mapping (bijection) between their vertex sets that preserves edges. That is, if vertex u is connected to vertex v in G1, then the mapped vertices must also be connected in G... |
1->3, 2->1, 3->4, 4->2 | 3 | {
"g1_edges": [
[
3,
4
]
],
"g2_edges": [
[
2,
4
]
],
"ground_truth_perm": {
"1": 3,
"2": 1,
"3": 4,
"4": 2
},
"is_isomorphic": true,
"n_nodes": 4
} | You are given two graphs G1 and G2. Your task is to determine whether they are isomorphic.
Two graphs are isomorphic if there exists a one-to-one mapping (bijection) between their vertex sets that preserves edges. That is, if vertex u is connected to vertex v in G1, then the mapped vertices must also be connected in G... |
1->3, 2->2, 3->4, 4->1 | 3 | {
"g1_edges": [
[
1,
3
],
[
2,
3
],
[
3,
4
]
],
"g2_edges": [
[
1,
4
],
[
2,
4
],
[
3,
4
]
],
"ground_truth_perm": {
"1": 3,
"2": 2,
"3": 4,
"4": 1
},
"is_isomorphic": tr... | You are given two graphs G1 and G2. Your task is to determine whether they are isomorphic.
Two graphs are isomorphic if there exists a one-to-one mapping (bijection) between their vertex sets that preserves edges. That is, if vertex u is connected to vertex v in G1, then the mapped vertices must also be connected in G... |
1->1, 2->2, 3->3, 4->4 | 3 | {
"g1_edges": [
[
1,
2
],
[
1,
3
],
[
3,
4
]
],
"g2_edges": [
[
1,
2
],
[
1,
3
],
[
3,
4
]
],
"ground_truth_perm": {
"1": 1,
"2": 2,
"3": 3,
"4": 4
},
"is_isomorphic": tr... | You are given two graphs G1 and G2. Your task is to determine whether they are isomorphic.
Two graphs are isomorphic if there exists a one-to-one mapping (bijection) between their vertex sets that preserves edges. That is, if vertex u is connected to vertex v in G1, then the mapped vertices must also be connected in G... |
1->1, 2->3, 3->4, 4->2 | 3 | {
"g1_edges": [
[
1,
2
],
[
2,
3
],
[
2,
4
],
[
3,
4
]
],
"g2_edges": [
[
1,
3
],
[
2,
3
],
[
2,
4
],
[
3,
4
]
],
"ground_truth_perm": {
"1": 1,
... | You are given two graphs G1 and G2. Your task is to determine whether they are isomorphic.
Two graphs are isomorphic if there exists a one-to-one mapping (bijection) between their vertex sets that preserves edges. That is, if vertex u is connected to vertex v in G1, then the mapped vertices must also be connected in G... |
1->2, 2->4, 3->3, 4->1 | 3 | {
"g1_edges": [
[
1,
3
],
[
1,
4
],
[
2,
4
],
[
3,
4
]
],
"g2_edges": [
[
1,
2
],
[
1,
3
],
[
1,
4
],
[
2,
3
]
],
"ground_truth_perm": {
"1": 2,
... | You are given two graphs G1 and G2. Your task is to determine whether they are isomorphic.
Two graphs are isomorphic if there exists a one-to-one mapping (bijection) between their vertex sets that preserves edges. That is, if vertex u is connected to vertex v in G1, then the mapped vertices must also be connected in G... |
1->1, 2->3, 3->4, 4->2 | 3 | {
"g1_edges": [
[
1,
2
],
[
1,
4
],
[
2,
3
],
[
2,
4
]
],
"g2_edges": [
[
1,
2
],
[
1,
3
],
[
2,
3
],
[
3,
4
]
],
"ground_truth_perm": {
"1": 1,
... | You are given two graphs G1 and G2. Your task is to determine whether they are isomorphic.
Two graphs are isomorphic if there exists a one-to-one mapping (bijection) between their vertex sets that preserves edges. That is, if vertex u is connected to vertex v in G1, then the mapped vertices must also be connected in G... |
1->2, 2->1, 3->4, 4->3 | 3 | {
"g1_edges": [
[
1,
2
],
[
1,
4
],
[
2,
3
]
],
"g2_edges": [
[
1,
2
],
[
1,
4
],
[
2,
3
]
],
"ground_truth_perm": {
"1": 2,
"2": 1,
"3": 4,
"4": 3
},
"is_isomorphic": tr... | You are given two graphs G1 and G2. Your task is to determine whether they are isomorphic.
Two graphs are isomorphic if there exists a one-to-one mapping (bijection) between their vertex sets that preserves edges. That is, if vertex u is connected to vertex v in G1, then the mapped vertices must also be connected in G... |
1->1, 2->4, 3->2, 4->3 | 3 | {
"g1_edges": [
[
1,
2
],
[
1,
3
],
[
1,
4
],
[
2,
4
],
[
3,
4
]
],
"g2_edges": [
[
1,
2
],
[
1,
3
],
[
1,
4
],
[
2,
3
],
[
... | You are given two graphs G1 and G2. Your task is to determine whether they are isomorphic.
Two graphs are isomorphic if there exists a one-to-one mapping (bijection) between their vertex sets that preserves edges. That is, if vertex u is connected to vertex v in G1, then the mapped vertices must also be connected in G... |
1->1, 2->3, 3->4, 4->2 | 3 | {
"g1_edges": [
[
1,
2
],
[
2,
4
],
[
3,
4
]
],
"g2_edges": [
[
1,
3
],
[
2,
3
],
[
2,
4
]
],
"ground_truth_perm": {
"1": 1,
"2": 3,
"3": 4,
"4": 2
},
"is_isomorphic": tr... | You are given two graphs G1 and G2. Your task is to determine whether they are isomorphic.
Two graphs are isomorphic if there exists a one-to-one mapping (bijection) between their vertex sets that preserves edges. That is, if vertex u is connected to vertex v in G1, then the mapped vertices must also be connected in G... |
1->3, 2->4, 3->2, 4->1 | 3 | {
"g1_edges": [
[
1,
2
],
[
1,
3
],
[
1,
4
],
[
2,
3
]
],
"g2_edges": [
[
1,
3
],
[
2,
3
],
[
2,
4
],
[
3,
4
]
],
"ground_truth_perm": {
"1": 3,
... | You are given two graphs G1 and G2. Your task is to determine whether they are isomorphic.
Two graphs are isomorphic if there exists a one-to-one mapping (bijection) between their vertex sets that preserves edges. That is, if vertex u is connected to vertex v in G1, then the mapped vertices must also be connected in G... |
1->3, 2->4, 3->1, 4->2 | 3 | {
"g1_edges": [
[
3,
4
]
],
"g2_edges": [
[
1,
2
]
],
"ground_truth_perm": {
"1": 3,
"2": 4,
"3": 1,
"4": 2
},
"is_isomorphic": true,
"n_nodes": 4
} | You are given two graphs G1 and G2. Your task is to determine whether they are isomorphic.
Two graphs are isomorphic if there exists a one-to-one mapping (bijection) between their vertex sets that preserves edges. That is, if vertex u is connected to vertex v in G1, then the mapped vertices must also be connected in G... |
1->2, 2->4, 3->3, 4->1 | 3 | {
"g1_edges": [
[
1,
2
],
[
1,
3
],
[
1,
4
]
],
"g2_edges": [
[
1,
2
],
[
2,
3
],
[
2,
4
]
],
"ground_truth_perm": {
"1": 2,
"2": 4,
"3": 3,
"4": 1
},
"is_isomorphic": tr... | You are given two graphs G1 and G2. Your task is to determine whether they are isomorphic.
Two graphs are isomorphic if there exists a one-to-one mapping (bijection) between their vertex sets that preserves edges. That is, if vertex u is connected to vertex v in G1, then the mapped vertices must also be connected in G... |
1->4, 2->2, 3->1, 4->3 | 3 | {
"g1_edges": [
[
1,
3
],
[
1,
4
],
[
2,
3
],
[
2,
4
],
[
3,
4
]
],
"g2_edges": [
[
1,
2
],
[
1,
3
],
[
1,
4
],
[
2,
3
],
[
... | You are given two graphs G1 and G2. Your task is to determine whether they are isomorphic.
Two graphs are isomorphic if there exists a one-to-one mapping (bijection) between their vertex sets that preserves edges. That is, if vertex u is connected to vertex v in G1, then the mapped vertices must also be connected in G... |
1->3, 2->2, 3->4, 4->1 | 3 | {
"g1_edges": [
[
1,
2
],
[
1,
3
],
[
2,
3
],
[
3,
4
]
],
"g2_edges": [
[
1,
4
],
[
2,
3
],
[
2,
4
],
[
3,
4
]
],
"ground_truth_perm": {
"1": 3,
... | You are given two graphs G1 and G2. Your task is to determine whether they are isomorphic.
Two graphs are isomorphic if there exists a one-to-one mapping (bijection) between their vertex sets that preserves edges. That is, if vertex u is connected to vertex v in G1, then the mapped vertices must also be connected in G... |
1->2, 2->1, 3->4, 4->3 | 3 | {
"g1_edges": [
[
1,
2
],
[
1,
3
],
[
1,
4
],
[
2,
3
]
],
"g2_edges": [
[
1,
2
],
[
1,
4
],
[
2,
3
],
[
2,
4
]
],
"ground_truth_perm": {
"1": 2,
... | You are given two graphs G1 and G2. Your task is to determine whether they are isomorphic.
Two graphs are isomorphic if there exists a one-to-one mapping (bijection) between their vertex sets that preserves edges. That is, if vertex u is connected to vertex v in G1, then the mapped vertices must also be connected in G... |
1->1, 2->4, 3->3, 4->2 | 3 | {
"g1_edges": [
[
1,
3
],
[
1,
4
],
[
3,
4
]
],
"g2_edges": [
[
1,
2
],
[
1,
3
],
[
2,
3
]
],
"ground_truth_perm": {
"1": 1,
"2": 4,
"3": 3,
"4": 2
},
"is_isomorphic": tr... | You are given two graphs G1 and G2. Your task is to determine whether they are isomorphic.
Two graphs are isomorphic if there exists a one-to-one mapping (bijection) between their vertex sets that preserves edges. That is, if vertex u is connected to vertex v in G1, then the mapped vertices must also be connected in G... |
1->3, 2->4, 3->2, 4->1 | 3 | {
"g1_edges": [
[
1,
3
],
[
3,
4
]
],
"g2_edges": [
[
1,
2
],
[
2,
3
]
],
"ground_truth_perm": {
"1": 3,
"2": 4,
"3": 2,
"4": 1
},
"is_isomorphic": true,
"n_nodes": 4
} | You are given two graphs G1 and G2. Your task is to determine whether they are isomorphic.
Two graphs are isomorphic if there exists a one-to-one mapping (bijection) between their vertex sets that preserves edges. That is, if vertex u is connected to vertex v in G1, then the mapped vertices must also be connected in G... |
1->2, 2->4, 3->3, 4->1 | 3 | {
"g1_edges": [
[
1,
2
],
[
1,
3
],
[
1,
4
],
[
2,
3
],
[
2,
4
]
],
"g2_edges": [
[
1,
2
],
[
1,
4
],
[
2,
3
],
[
2,
4
],
[
... | You are given two graphs G1 and G2. Your task is to determine whether they are isomorphic.
Two graphs are isomorphic if there exists a one-to-one mapping (bijection) between their vertex sets that preserves edges. That is, if vertex u is connected to vertex v in G1, then the mapped vertices must also be connected in G... |
1->3, 2->2, 3->4, 4->1 | 3 | {
"g1_edges": [
[
1,
2
]
],
"g2_edges": [
[
2,
3
]
],
"ground_truth_perm": {
"1": 3,
"2": 2,
"3": 4,
"4": 1
},
"is_isomorphic": true,
"n_nodes": 4
} | You are given two graphs G1 and G2. Your task is to determine whether they are isomorphic.
Two graphs are isomorphic if there exists a one-to-one mapping (bijection) between their vertex sets that preserves edges. That is, if vertex u is connected to vertex v in G1, then the mapped vertices must also be connected in G... |
1->4, 2->3, 3->2, 4->1 | 3 | {
"g1_edges": [
[
1,
2
],
[
2,
4
]
],
"g2_edges": [
[
1,
3
],
[
3,
4
]
],
"ground_truth_perm": {
"1": 4,
"2": 3,
"3": 2,
"4": 1
},
"is_isomorphic": true,
"n_nodes": 4
} | You are given two graphs G1 and G2. Your task is to determine whether they are isomorphic.
Two graphs are isomorphic if there exists a one-to-one mapping (bijection) between their vertex sets that preserves edges. That is, if vertex u is connected to vertex v in G1, then the mapped vertices must also be connected in G... |
1->2, 2->1, 3->4, 4->3 | 3 | {
"g1_edges": [
[
1,
2
],
[
1,
4
]
],
"g2_edges": [
[
1,
2
],
[
2,
3
]
],
"ground_truth_perm": {
"1": 2,
"2": 1,
"3": 4,
"4": 3
},
"is_isomorphic": true,
"n_nodes": 4
} | You are given two graphs G1 and G2. Your task is to determine whether they are isomorphic.
Two graphs are isomorphic if there exists a one-to-one mapping (bijection) between their vertex sets that preserves edges. That is, if vertex u is connected to vertex v in G1, then the mapped vertices must also be connected in G... |
1->4, 2->2, 3->3, 4->1 | 3 | {
"g1_edges": [
[
1,
2
],
[
1,
3
],
[
1,
4
],
[
2,
3
],
[
3,
4
]
],
"g2_edges": [
[
1,
3
],
[
1,
4
],
[
2,
3
],
[
2,
4
],
[
... | You are given two graphs G1 and G2. Your task is to determine whether they are isomorphic.
Two graphs are isomorphic if there exists a one-to-one mapping (bijection) between their vertex sets that preserves edges. That is, if vertex u is connected to vertex v in G1, then the mapped vertices must also be connected in G... |
1->4, 2->1, 3->3, 4->2 | 3 | {
"g1_edges": [
[
1,
4
],
[
2,
3
],
[
3,
4
]
],
"g2_edges": [
[
1,
3
],
[
2,
3
],
[
2,
4
]
],
"ground_truth_perm": {
"1": 4,
"2": 1,
"3": 3,
"4": 2
},
"is_isomorphic": tr... | You are given two graphs G1 and G2. Your task is to determine whether they are isomorphic.
Two graphs are isomorphic if there exists a one-to-one mapping (bijection) between their vertex sets that preserves edges. That is, if vertex u is connected to vertex v in G1, then the mapped vertices must also be connected in G... |
1->1, 2->3, 3->4, 4->2 | 3 | {
"g1_edges": [
[
1,
2
],
[
1,
4
],
[
2,
4
],
[
3,
4
]
],
"g2_edges": [
[
1,
2
],
[
1,
3
],
[
2,
3
],
[
2,
4
]
],
"ground_truth_perm": {
"1": 1,
... | You are given two graphs G1 and G2. Your task is to determine whether they are isomorphic.
Two graphs are isomorphic if there exists a one-to-one mapping (bijection) between their vertex sets that preserves edges. That is, if vertex u is connected to vertex v in G1, then the mapped vertices must also be connected in G... |
1->2, 2->4, 3->3, 4->1 | 3 | {
"g1_edges": [
[
1,
3
],
[
1,
4
],
[
2,
3
],
[
2,
4
],
[
3,
4
]
],
"g2_edges": [
[
1,
2
],
[
1,
3
],
[
1,
4
],
[
2,
3
],
[
... | You are given two graphs G1 and G2. Your task is to determine whether they are isomorphic.
Two graphs are isomorphic if there exists a one-to-one mapping (bijection) between their vertex sets that preserves edges. That is, if vertex u is connected to vertex v in G1, then the mapped vertices must also be connected in G... |
1->1, 2->2, 3->4, 4->3 | 3 | {
"g1_edges": [
[
1,
3
],
[
1,
4
]
],
"g2_edges": [
[
1,
3
],
[
1,
4
]
],
"ground_truth_perm": {
"1": 1,
"2": 2,
"3": 4,
"4": 3
},
"is_isomorphic": true,
"n_nodes": 4
} | You are given two graphs G1 and G2. Your task is to determine whether they are isomorphic.
Two graphs are isomorphic if there exists a one-to-one mapping (bijection) between their vertex sets that preserves edges. That is, if vertex u is connected to vertex v in G1, then the mapped vertices must also be connected in G... |
1->1, 2->4, 3->2, 4->3 | 3 | {
"g1_edges": [
[
1,
2
]
],
"g2_edges": [
[
1,
4
]
],
"ground_truth_perm": {
"1": 1,
"2": 4,
"3": 2,
"4": 3
},
"is_isomorphic": true,
"n_nodes": 4
} | You are given two graphs G1 and G2. Your task is to determine whether they are isomorphic.
Two graphs are isomorphic if there exists a one-to-one mapping (bijection) between their vertex sets that preserves edges. That is, if vertex u is connected to vertex v in G1, then the mapped vertices must also be connected in G... |
1->4, 2->1, 3->2, 4->3 | 3 | {
"g1_edges": [
[
1,
3
],
[
2,
3
],
[
3,
4
]
],
"g2_edges": [
[
1,
2
],
[
2,
3
],
[
2,
4
]
],
"ground_truth_perm": {
"1": 4,
"2": 1,
"3": 2,
"4": 3
},
"is_isomorphic": tr... | You are given two graphs G1 and G2. Your task is to determine whether they are isomorphic.
Two graphs are isomorphic if there exists a one-to-one mapping (bijection) between their vertex sets that preserves edges. That is, if vertex u is connected to vertex v in G1, then the mapped vertices must also be connected in G... |
1->1, 2->4, 3->2, 4->3 | 3 | {
"g1_edges": [
[
2,
4
],
[
3,
4
]
],
"g2_edges": [
[
2,
3
],
[
3,
4
]
],
"ground_truth_perm": {
"1": 1,
"2": 4,
"3": 2,
"4": 3
},
"is_isomorphic": true,
"n_nodes": 4
} | You are given two graphs G1 and G2. Your task is to determine whether they are isomorphic.
Two graphs are isomorphic if there exists a one-to-one mapping (bijection) between their vertex sets that preserves edges. That is, if vertex u is connected to vertex v in G1, then the mapped vertices must also be connected in G... |
1->2, 2->4, 3->1, 4->3 | 3 | {
"g1_edges": [
[
3,
4
]
],
"g2_edges": [
[
1,
3
]
],
"ground_truth_perm": {
"1": 2,
"2": 4,
"3": 1,
"4": 3
},
"is_isomorphic": true,
"n_nodes": 4
} | You are given two graphs G1 and G2. Your task is to determine whether they are isomorphic.
Two graphs are isomorphic if there exists a one-to-one mapping (bijection) between their vertex sets that preserves edges. That is, if vertex u is connected to vertex v in G1, then the mapped vertices must also be connected in G... |
1->4, 2->3, 3->1, 4->2 | 3 | {
"g1_edges": [
[
1,
4
],
[
2,
4
],
[
3,
4
]
],
"g2_edges": [
[
1,
2
],
[
2,
3
],
[
2,
4
]
],
"ground_truth_perm": {
"1": 4,
"2": 3,
"3": 1,
"4": 2
},
"is_isomorphic": tr... | You are given two graphs G1 and G2. Your task is to determine whether they are isomorphic.
Two graphs are isomorphic if there exists a one-to-one mapping (bijection) between their vertex sets that preserves edges. That is, if vertex u is connected to vertex v in G1, then the mapped vertices must also be connected in G... |
1->1, 2->2, 3->4, 4->3 | 3 | {
"g1_edges": [
[
1,
2
],
[
1,
4
],
[
2,
4
],
[
3,
4
]
],
"g2_edges": [
[
1,
2
],
[
1,
3
],
[
2,
3
],
[
3,
4
]
],
"ground_truth_perm": {
"1": 1,
... | You are given two graphs G1 and G2. Your task is to determine whether they are isomorphic.
Two graphs are isomorphic if there exists a one-to-one mapping (bijection) between their vertex sets that preserves edges. That is, if vertex u is connected to vertex v in G1, then the mapped vertices must also be connected in G... |
1->4, 2->3, 3->2, 4->1 | 3 | {
"g1_edges": [
[
2,
4
],
[
3,
4
]
],
"g2_edges": [
[
1,
2
],
[
1,
3
]
],
"ground_truth_perm": {
"1": 4,
"2": 3,
"3": 2,
"4": 1
},
"is_isomorphic": true,
"n_nodes": 4
} | You are given two graphs G1 and G2. Your task is to determine whether they are isomorphic.
Two graphs are isomorphic if there exists a one-to-one mapping (bijection) between their vertex sets that preserves edges. That is, if vertex u is connected to vertex v in G1, then the mapped vertices must also be connected in G... |
1->1, 2->2, 3->4, 4->3 | 3 | {
"g1_edges": [
[
1,
2
],
[
1,
3
],
[
1,
4
],
[
2,
3
],
[
3,
4
]
],
"g2_edges": [
[
1,
2
],
[
1,
3
],
[
1,
4
],
[
2,
4
],
[
... | You are given two graphs G1 and G2. Your task is to determine whether they are isomorphic.
Two graphs are isomorphic if there exists a one-to-one mapping (bijection) between their vertex sets that preserves edges. That is, if vertex u is connected to vertex v in G1, then the mapped vertices must also be connected in G... |
1->1, 2->2, 3->3, 4->4 | 3 | {
"g1_edges": [
[
1,
4
],
[
2,
3
],
[
2,
4
],
[
3,
4
]
],
"g2_edges": [
[
1,
4
],
[
2,
3
],
[
2,
4
],
[
3,
4
]
],
"ground_truth_perm": {
"1": 1,
... | You are given two graphs G1 and G2. Your task is to determine whether they are isomorphic.
Two graphs are isomorphic if there exists a one-to-one mapping (bijection) between their vertex sets that preserves edges. That is, if vertex u is connected to vertex v in G1, then the mapped vertices must also be connected in G... |
1->3, 2->4, 3->1, 4->2 | 3 | {
"g1_edges": [
[
1,
2
],
[
1,
3
],
[
1,
4
]
],
"g2_edges": [
[
1,
3
],
[
2,
3
],
[
3,
4
]
],
"ground_truth_perm": {
"1": 3,
"2": 4,
"3": 1,
"4": 2
},
"is_isomorphic": tr... | You are given two graphs G1 and G2. Your task is to determine whether they are isomorphic.
Two graphs are isomorphic if there exists a one-to-one mapping (bijection) between their vertex sets that preserves edges. That is, if vertex u is connected to vertex v in G1, then the mapped vertices must also be connected in G... |
1->3, 2->1, 3->4, 4->2 | 3 | {
"g1_edges": [
[
1,
3
],
[
1,
4
],
[
2,
3
],
[
2,
4
],
[
3,
4
]
],
"g2_edges": [
[
1,
2
],
[
1,
4
],
[
2,
3
],
[
2,
4
],
[
... | You are given two graphs G1 and G2. Your task is to determine whether they are isomorphic.
Two graphs are isomorphic if there exists a one-to-one mapping (bijection) between their vertex sets that preserves edges. That is, if vertex u is connected to vertex v in G1, then the mapped vertices must also be connected in G... |
1->3, 2->1, 3->4, 4->2 | 3 | {
"g1_edges": [
[
1,
2
],
[
1,
4
],
[
3,
4
]
],
"g2_edges": [
[
1,
3
],
[
2,
3
],
[
2,
4
]
],
"ground_truth_perm": {
"1": 3,
"2": 1,
"3": 4,
"4": 2
},
"is_isomorphic": tr... | You are given two graphs G1 and G2. Your task is to determine whether they are isomorphic.
Two graphs are isomorphic if there exists a one-to-one mapping (bijection) between their vertex sets that preserves edges. That is, if vertex u is connected to vertex v in G1, then the mapped vertices must also be connected in G... |
1->2, 2->4, 3->3, 4->1 | 3 | {
"g1_edges": [
[
1,
2
],
[
1,
3
],
[
1,
4
],
[
2,
4
],
[
3,
4
]
],
"g2_edges": [
[
1,
2
],
[
1,
3
],
[
1,
4
],
[
2,
3
],
[
... | You are given two graphs G1 and G2. Your task is to determine whether they are isomorphic.
Two graphs are isomorphic if there exists a one-to-one mapping (bijection) between their vertex sets that preserves edges. That is, if vertex u is connected to vertex v in G1, then the mapped vertices must also be connected in G... |
1->1, 2->4, 3->3, 4->2 | 3 | {
"g1_edges": [
[
1,
3
],
[
2,
3
],
[
3,
4
]
],
"g2_edges": [
[
1,
3
],
[
2,
3
],
[
3,
4
]
],
"ground_truth_perm": {
"1": 1,
"2": 4,
"3": 3,
"4": 2
},
"is_isomorphic": tr... | You are given two graphs G1 and G2. Your task is to determine whether they are isomorphic.
Two graphs are isomorphic if there exists a one-to-one mapping (bijection) between their vertex sets that preserves edges. That is, if vertex u is connected to vertex v in G1, then the mapped vertices must also be connected in G... |
1->1, 2->3, 3->2, 4->4 | 3 | {
"g1_edges": [
[
1,
2
],
[
2,
3
]
],
"g2_edges": [
[
1,
3
],
[
2,
3
]
],
"ground_truth_perm": {
"1": 1,
"2": 3,
"3": 2,
"4": 4
},
"is_isomorphic": true,
"n_nodes": 4
} | You are given two graphs G1 and G2. Your task is to determine whether they are isomorphic.
Two graphs are isomorphic if there exists a one-to-one mapping (bijection) between their vertex sets that preserves edges. That is, if vertex u is connected to vertex v in G1, then the mapped vertices must also be connected in G... |
1->4, 2->1, 3->2, 4->3 | 3 | {
"g1_edges": [
[
1,
4
],
[
2,
4
]
],
"g2_edges": [
[
1,
3
],
[
3,
4
]
],
"ground_truth_perm": {
"1": 4,
"2": 1,
"3": 2,
"4": 3
},
"is_isomorphic": true,
"n_nodes": 4
} | You are given two graphs G1 and G2. Your task is to determine whether they are isomorphic.
Two graphs are isomorphic if there exists a one-to-one mapping (bijection) between their vertex sets that preserves edges. That is, if vertex u is connected to vertex v in G1, then the mapped vertices must also be connected in G... |
1->1, 2->4, 3->2, 4->3 | 3 | {
"g1_edges": [
[
1,
2
],
[
1,
4
],
[
2,
3
],
[
3,
4
]
],
"g2_edges": [
[
1,
3
],
[
1,
4
],
[
2,
3
],
[
2,
4
]
],
"ground_truth_perm": {
"1": 1,
... | You are given two graphs G1 and G2. Your task is to determine whether they are isomorphic.
Two graphs are isomorphic if there exists a one-to-one mapping (bijection) between their vertex sets that preserves edges. That is, if vertex u is connected to vertex v in G1, then the mapped vertices must also be connected in G... |
1->2, 2->4, 3->1, 4->3 | 3 | {
"g1_edges": [
[
1,
4
],
[
2,
3
],
[
2,
4
],
[
3,
4
]
],
"g2_edges": [
[
1,
3
],
[
1,
4
],
[
2,
3
],
[
3,
4
]
],
"ground_truth_perm": {
"1": 2,
... | You are given two graphs G1 and G2. Your task is to determine whether they are isomorphic.
Two graphs are isomorphic if there exists a one-to-one mapping (bijection) between their vertex sets that preserves edges. That is, if vertex u is connected to vertex v in G1, then the mapped vertices must also be connected in G... |
1->1, 2->4, 3->2, 4->3 | 3 | {
"g1_edges": [
[
1,
3
],
[
2,
4
]
],
"g2_edges": [
[
1,
2
],
[
3,
4
]
],
"ground_truth_perm": {
"1": 1,
"2": 4,
"3": 2,
"4": 3
},
"is_isomorphic": true,
"n_nodes": 4
} | You are given two graphs G1 and G2. Your task is to determine whether they are isomorphic.
Two graphs are isomorphic if there exists a one-to-one mapping (bijection) between their vertex sets that preserves edges. That is, if vertex u is connected to vertex v in G1, then the mapped vertices must also be connected in G... |
1->3, 2->2, 3->1, 4->4 | 3 | {
"g1_edges": [
[
1,
3
],
[
1,
4
],
[
3,
4
]
],
"g2_edges": [
[
1,
3
],
[
1,
4
],
[
3,
4
]
],
"ground_truth_perm": {
"1": 3,
"2": 2,
"3": 1,
"4": 4
},
"is_isomorphic": tr... | You are given two graphs G1 and G2. Your task is to determine whether they are isomorphic.
Two graphs are isomorphic if there exists a one-to-one mapping (bijection) between their vertex sets that preserves edges. That is, if vertex u is connected to vertex v in G1, then the mapped vertices must also be connected in G... |
1->4, 2->3, 3->2, 4->1 | 3 | {
"g1_edges": [
[
1,
3
]
],
"g2_edges": [
[
2,
4
]
],
"ground_truth_perm": {
"1": 4,
"2": 3,
"3": 2,
"4": 1
},
"is_isomorphic": true,
"n_nodes": 4
} | You are given two graphs G1 and G2. Your task is to determine whether they are isomorphic.
Two graphs are isomorphic if there exists a one-to-one mapping (bijection) between their vertex sets that preserves edges. That is, if vertex u is connected to vertex v in G1, then the mapped vertices must also be connected in G... |
1->2, 2->1, 3->4, 4->3 | 3 | {
"g1_edges": [
[
1,
2
],
[
2,
4
],
[
3,
4
]
],
"g2_edges": [
[
1,
2
],
[
1,
3
],
[
3,
4
]
],
"ground_truth_perm": {
"1": 2,
"2": 1,
"3": 4,
"4": 3
},
"is_isomorphic": tr... | You are given two graphs G1 and G2. Your task is to determine whether they are isomorphic.
Two graphs are isomorphic if there exists a one-to-one mapping (bijection) between their vertex sets that preserves edges. That is, if vertex u is connected to vertex v in G1, then the mapped vertices must also be connected in G... |
1->4, 2->3, 3->1, 4->2 | 3 | {
"g1_edges": [
[
1,
2
],
[
1,
3
],
[
3,
4
]
],
"g2_edges": [
[
1,
2
],
[
1,
4
],
[
3,
4
]
],
"ground_truth_perm": {
"1": 4,
"2": 3,
"3": 1,
"4": 2
},
"is_isomorphic": tr... | You are given two graphs G1 and G2. Your task is to determine whether they are isomorphic.
Two graphs are isomorphic if there exists a one-to-one mapping (bijection) between their vertex sets that preserves edges. That is, if vertex u is connected to vertex v in G1, then the mapped vertices must also be connected in G... |
1->4, 2->1, 3->2, 4->3 | 3 | {
"g1_edges": [
[
1,
2
],
[
1,
3
],
[
1,
4
]
],
"g2_edges": [
[
1,
4
],
[
2,
4
],
[
3,
4
]
],
"ground_truth_perm": {
"1": 4,
"2": 1,
"3": 2,
"4": 3
},
"is_isomorphic": tr... | You are given two graphs G1 and G2. Your task is to determine whether they are isomorphic.
Two graphs are isomorphic if there exists a one-to-one mapping (bijection) between their vertex sets that preserves edges. That is, if vertex u is connected to vertex v in G1, then the mapped vertices must also be connected in G... |
1->3, 2->2, 3->1, 4->4 | 3 | {
"g1_edges": [
[
1,
2
],
[
1,
3
],
[
2,
3
]
],
"g2_edges": [
[
1,
2
],
[
1,
3
],
[
2,
3
]
],
"ground_truth_perm": {
"1": 3,
"2": 2,
"3": 1,
"4": 4
},
"is_isomorphic": tr... | You are given two graphs G1 and G2. Your task is to determine whether they are isomorphic.
Two graphs are isomorphic if there exists a one-to-one mapping (bijection) between their vertex sets that preserves edges. That is, if vertex u is connected to vertex v in G1, then the mapped vertices must also be connected in G... |
1->1, 2->4, 3->2, 4->3 | 3 | {
"g1_edges": [
[
1,
2
],
[
1,
3
],
[
2,
3
],
[
3,
4
]
],
"g2_edges": [
[
1,
2
],
[
1,
4
],
[
2,
3
],
[
2,
4
]
],
"ground_truth_perm": {
"1": 1,
... | You are given two graphs G1 and G2. Your task is to determine whether they are isomorphic.
Two graphs are isomorphic if there exists a one-to-one mapping (bijection) between their vertex sets that preserves edges. That is, if vertex u is connected to vertex v in G1, then the mapped vertices must also be connected in G... |
1->1, 2->3, 3->2, 4->4 | 3 | {
"g1_edges": [
[
1,
2
],
[
1,
3
],
[
2,
3
],
[
3,
4
]
],
"g2_edges": [
[
1,
2
],
[
1,
3
],
[
2,
3
],
[
2,
4
]
],
"ground_truth_perm": {
"1": 1,
... | You are given two graphs G1 and G2. Your task is to determine whether they are isomorphic.
Two graphs are isomorphic if there exists a one-to-one mapping (bijection) between their vertex sets that preserves edges. That is, if vertex u is connected to vertex v in G1, then the mapped vertices must also be connected in G... |
1->4, 2->2, 3->3, 4->1 | 3 | {
"g1_edges": [
[
1,
4
],
[
3,
4
]
],
"g2_edges": [
[
1,
3
],
[
1,
4
]
],
"ground_truth_perm": {
"1": 4,
"2": 2,
"3": 3,
"4": 1
},
"is_isomorphic": true,
"n_nodes": 4
} | You are given two graphs G1 and G2. Your task is to determine whether they are isomorphic.
Two graphs are isomorphic if there exists a one-to-one mapping (bijection) between their vertex sets that preserves edges. That is, if vertex u is connected to vertex v in G1, then the mapped vertices must also be connected in G... |
1->3, 2->1, 3->2, 4->4 | 3 | {
"g1_edges": [
[
1,
4
],
[
2,
4
]
],
"g2_edges": [
[
1,
4
],
[
3,
4
]
],
"ground_truth_perm": {
"1": 3,
"2": 1,
"3": 2,
"4": 4
},
"is_isomorphic": true,
"n_nodes": 4
} | You are given two graphs G1 and G2. Your task is to determine whether they are isomorphic.
Two graphs are isomorphic if there exists a one-to-one mapping (bijection) between their vertex sets that preserves edges. That is, if vertex u is connected to vertex v in G1, then the mapped vertices must also be connected in G... |
1->3, 2->4, 3->2, 4->1 | 3 | {
"g1_edges": [
[
1,
2
],
[
1,
4
],
[
2,
3
]
],
"g2_edges": [
[
1,
3
],
[
2,
4
],
[
3,
4
]
],
"ground_truth_perm": {
"1": 3,
"2": 4,
"3": 2,
"4": 1
},
"is_isomorphic": tr... | You are given two graphs G1 and G2. Your task is to determine whether they are isomorphic.
Two graphs are isomorphic if there exists a one-to-one mapping (bijection) between their vertex sets that preserves edges. That is, if vertex u is connected to vertex v in G1, then the mapped vertices must also be connected in G... |
1->4, 2->1, 3->2, 4->3 | 3 | {
"g1_edges": [
[
1,
3
],
[
2,
3
],
[
2,
4
]
],
"g2_edges": [
[
1,
2
],
[
1,
3
],
[
2,
4
]
],
"ground_truth_perm": {
"1": 4,
"2": 1,
"3": 2,
"4": 3
},
"is_isomorphic": tr... | You are given two graphs G1 and G2. Your task is to determine whether they are isomorphic.
Two graphs are isomorphic if there exists a one-to-one mapping (bijection) between their vertex sets that preserves edges. That is, if vertex u is connected to vertex v in G1, then the mapped vertices must also be connected in G... |
1->4, 2->2, 3->3, 4->1 | 3 | {
"g1_edges": [
[
1,
2
],
[
1,
3
],
[
1,
4
],
[
2,
4
],
[
3,
4
]
],
"g2_edges": [
[
1,
2
],
[
1,
3
],
[
1,
4
],
[
2,
4
],
[
... | You are given two graphs G1 and G2. Your task is to determine whether they are isomorphic.
Two graphs are isomorphic if there exists a one-to-one mapping (bijection) between their vertex sets that preserves edges. That is, if vertex u is connected to vertex v in G1, then the mapped vertices must also be connected in G... |
1->4, 2->1, 3->3, 4->2 | 3 | {
"g1_edges": [
[
3,
4
]
],
"g2_edges": [
[
2,
3
]
],
"ground_truth_perm": {
"1": 4,
"2": 1,
"3": 3,
"4": 2
},
"is_isomorphic": true,
"n_nodes": 4
} | You are given two graphs G1 and G2. Your task is to determine whether they are isomorphic.
Two graphs are isomorphic if there exists a one-to-one mapping (bijection) between their vertex sets that preserves edges. That is, if vertex u is connected to vertex v in G1, then the mapped vertices must also be connected in G... |
1->2, 2->1, 3->4, 4->3 | 3 | {
"g1_edges": [
[
1,
3
],
[
2,
4
],
[
3,
4
]
],
"g2_edges": [
[
1,
3
],
[
2,
4
],
[
3,
4
]
],
"ground_truth_perm": {
"1": 2,
"2": 1,
"3": 4,
"4": 3
},
"is_isomorphic": tr... | You are given two graphs G1 and G2. Your task is to determine whether they are isomorphic.
Two graphs are isomorphic if there exists a one-to-one mapping (bijection) between their vertex sets that preserves edges. That is, if vertex u is connected to vertex v in G1, then the mapped vertices must also be connected in G... |
1->4, 2->3, 3->2, 4->1 | 3 | {
"g1_edges": [
[
1,
2
],
[
2,
3
],
[
2,
4
]
],
"g2_edges": [
[
1,
3
],
[
2,
3
],
[
3,
4
]
],
"ground_truth_perm": {
"1": 4,
"2": 3,
"3": 2,
"4": 1
},
"is_isomorphic": tr... | You are given two graphs G1 and G2. Your task is to determine whether they are isomorphic.
Two graphs are isomorphic if there exists a one-to-one mapping (bijection) between their vertex sets that preserves edges. That is, if vertex u is connected to vertex v in G1, then the mapped vertices must also be connected in G... |
1->3, 2->4, 3->1, 4->2 | 3 | {
"g1_edges": [
[
1,
3
],
[
1,
4
],
[
2,
4
]
],
"g2_edges": [
[
1,
3
],
[
2,
3
],
[
2,
4
]
],
"ground_truth_perm": {
"1": 3,
"2": 4,
"3": 1,
"4": 2
},
"is_isomorphic": tr... | You are given two graphs G1 and G2. Your task is to determine whether they are isomorphic.
Two graphs are isomorphic if there exists a one-to-one mapping (bijection) between their vertex sets that preserves edges. That is, if vertex u is connected to vertex v in G1, then the mapped vertices must also be connected in G... |
1->3, 2->2, 3->1, 4->4 | 3 | {
"g1_edges": [
[
1,
3
],
[
1,
4
]
],
"g2_edges": [
[
1,
3
],
[
3,
4
]
],
"ground_truth_perm": {
"1": 3,
"2": 2,
"3": 1,
"4": 4
},
"is_isomorphic": true,
"n_nodes": 4
} | You are given two graphs G1 and G2. Your task is to determine whether they are isomorphic.
Two graphs are isomorphic if there exists a one-to-one mapping (bijection) between their vertex sets that preserves edges. That is, if vertex u is connected to vertex v in G1, then the mapped vertices must also be connected in G... |
End of preview.
No dataset card yet
- Downloads last month
- 58