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