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