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