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