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