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