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 507 edges. G1 edges: 0, 23 , 14, 24 , 31, 35 , 7, 16 , 11, 34 , 17, 31 , 4, 24 , 23, 39 , 1, 18 , 21, 26 , 3, 29 , 4, 22 …
The task
Two undirected simple graphs G1 and G2 each have 40 vertices labelled 0..39 and 507 edges. G1 edges: [[0, 23], [14, 24], [31, 35], [7, 16], [11, 34], [17, 31], [4, 24], [23, 39], [1, 18], [21, 26], [3, 29], [4, 22], [27, 28], [36, 39], [2, 22], [22, 23], [11, 22], [30, 38], [19, 35], [1, 36], [28, 33], [1, 17], [3,…