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