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