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