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