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