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