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 429 edges. G1 edges: 13, 37 , 14, 22 , 8, 12 , 33, 39 , 4, 34 , 18, 36 , 12, 14 , 15, 24 , 9, 39 , 31, 35 , 15, 39 , 13…
The task
Two undirected simple graphs G1 and G2 each have 40 vertices labelled 0..39 and 429 edges. G1 edges: [[13, 37], [14, 22], [8, 12], [33, 39], [4, 34], [18, 36], [12, 14], [15, 24], [9, 39], [31, 35], [15, 39], [13, 34], [2, 20], [24, 39], [9, 19], [5, 25], [19, 28], [10, 15], [12, 30], [8, 38], [1, 24], [29, 39], [15,…