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