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