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