construct/rlve graph isomorphism
construct/rlve graph isomorphism: a task in MathConstructOptimize-Envs-harbor (Harbor dataset). Two undirected simple graphs G1 and G2 each have 12 vertices labelled 0..11 and 9 edges. G1 edges: 8, 10 , 6, 10 , 8, 11 , 0, 10 , 1, 10 , 1, 9 , 6, 8 , 8, 9 , 0, 9 G2 edges: 2, 9 , 1, 9 , 3, 9 , 3, 7 …
The task
Two undirected simple graphs G1 and G2 each have 12 vertices labelled 0..11 and 9 edges. G1 edges: [[8, 10], [6, 10], [8, 11], [0, 10], [1, 10], [1, 9], [6, 8], [8, 9], [0, 9]] G2 edges: [[2, 9], [1, 9], [3, 9], [3, 7], [1, 3], [3, 11], [10, 11], [9, 10], [7, 10]]