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