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