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