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