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