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