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 29 edges. G1 edges: 1, 5 , 1, 8 , 0, 2 , 4, 11 , 7, 8 , 5, 8 , 0, 8 , 6, 10 , 6, 9 , 8, 9 , 1, 11 , 2, 5 , 0, 6 , 0, 3 …
The task
Two undirected simple graphs G1 and G2 each have 12 vertices labelled 0..11 and 29 edges. G1 edges: [[1, 5], [1, 8], [0, 2], [4, 11], [7, 8], [5, 8], [0, 8], [6, 10], [6, 9], [8, 9], [1, 11], [2, 5], [0, 6], [0, 3], [3, 8], [8, 10], [0, 11], [0, 9], [1, 10], [6, 7], [0, 5], [7, 10], [1, 2], [3, 7], [2, 8], [4, 7],…