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: 15, 32 , 17, 36 , 13, 18 , 22, 28 , 15, 23 , 25, 33 , 24, 25 , 18, 33 , 1, 29 , 5, 8 , 27, 30 , 3, 24…
The task
Two undirected simple graphs G1 and G2 each have 40 vertices labelled 0..39 and 273 edges. G1 edges: [[15, 32], [17, 36], [13, 18], [22, 28], [15, 23], [25, 33], [24, 25], [18, 33], [1, 29], [5, 8], [27, 30], [3, 24], [5, 32], [12, 33], [16, 29], [3, 25], [0, 26], [1, 6], [5, 17], [22, 27], [8, 14], [6, 33], [14,…