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