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: 12, 36 , 18, 24 , 5, 7 , 1, 19 , 13, 35 , 13, 25 , 22, 29 , 8, 9 , 7, 12 , 3, 26 , 2, 25 , 8, 17 , 9…
The task
Two undirected simple graphs G1 and G2 each have 40 vertices labelled 0..39 and 273 edges. G1 edges: [[12, 36], [18, 24], [5, 7], [1, 19], [13, 35], [13, 25], [22, 29], [8, 9], [7, 12], [3, 26], [2, 25], [8, 17], [9, 15], [0, 12], [6, 28], [7, 27], [13, 18], [17, 39], [24, 36], [9, 11], [22, 31], [10, 21], [22, 25],…