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