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 12 vertices labelled 0..11 and 36 edges. G1 edges: 0, 1 , 7, 8 , 6, 7 , 9, 11 , 1, 3 , 3, 9 , 3, 5 , 5, 7 , 1, 11 , 3, 7 , 3, 10 , 4, 10 , 5, 8 , 6, 11 …