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