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 40 vertices labelled 0..39 and 351 edges. G1 edges: 22, 38 , 17, 19 , 1, 25 , 17, 27 , 19, 25 , 13, 29 , 22, 30 , 5, 34 , 25, 32 , 0, 16 , 28, 30 , 16…
The task
Two undirected simple graphs G1 and G2 each have 40 vertices labelled 0..39 and 351 edges. G1 edges: [[22, 38], [17, 19], [1, 25], [17, 27], [19, 25], [13, 29], [22, 30], [5, 34], [25, 32], [0, 16], [28, 30], [16, 30], [29, 38], [9, 20], [2, 29], [25, 26], [12, 26], [4, 30], [26, 36], [20, 31], [13, 33], [18, 34],…