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