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