Visual Graph Arena

The Visual Graph Arena Benchmark is a collection of six datasets designed to evaluate and enhance the visual reasoning capabilities of AI. The datasets are structured around three primary concepts, each divided into two tasks.1. **Graph Isomorphism Tasks**:    - *Easy Isomorphism*: Determining whether two given graphs are isomorphic, with non-isomorphic graphs chosen randomly.    - *Hard Isomorphism*: Determining whether two given graphs are isomorphic, with non-isomorphic graphs being degree-equivalent.    2. **Graph Path Finding Tasks**:    - *Hamiltonian Path*: Determining whether a given graph contains a Hamiltonian path.    - *Shortest Path*: Finding the shortest path length between two marked nodes in a graph.    3. **Graph Cycle Finding Tasks**:    - *Hamiltonian Cycle*: Determining whether a given graph contains a Hamiltonian cycle.    - *Biggest Chordless Cycle*: Finding the size of the largest chordless cycle in a graph.