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