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