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