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