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