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 117 edges. G1 edges: 11, 39 , 3, 24 , 2, 31 , 11, 20 , 22, 36 , 14, 26 , 1, 11 , 3, 15 , 15, 31 , 27, 36 , 24, 39 , 11, 29…
The task
Two undirected simple graphs G1 and G2 each have 40 vertices labelled 0..39 and 117 edges. G1 edges: [[11, 39], [3, 24], [2, 31], [11, 20], [22, 36], [14, 26], [1, 11], [3, 15], [15, 31], [27, 36], [24, 39], [11, 29], [7, 36], [0, 16], [1, 13], [11, 35], [4, 14], [8, 33], [25, 31], [3, 32], [1, 18], [12, 22], [28,…