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 273 edges. G1 edges: 13, 34 , 17, 28 , 17, 29 , 1, 26 , 0, 38 , 30, 31 , 8, 31 , 0, 37 , 34, 36 , 8, 28 , 6, 8 , 4, 5 …
The task
Two undirected simple graphs G1 and G2 each have 40 vertices labelled 0..39 and 273 edges. G1 edges: [[13, 34], [17, 28], [17, 29], [1, 26], [0, 38], [30, 31], [8, 31], [0, 37], [34, 36], [8, 28], [6, 8], [4, 5], [19, 23], [25, 31], [19, 28], [7, 39], [11, 30], [0, 22], [30, 33], [4, 27], [5, 6], [1, 32], [26, 32],…