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