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