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