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