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 18 vertices labelled 0..17 and 99 edges. G1 edges: 1, 4 , 3, 9 , 12, 17 , 3, 14 , 0, 16 , 12, 16 , 0, 5 , 0, 1 , 2, 7 , 9, 15 , 4, 13 , 3, 7 , 1, 2 , 3…
The task
Two undirected simple graphs G1 and G2 each have 18 vertices labelled 0..17 and 99 edges. G1 edges: [[1, 4], [3, 9], [12, 17], [3, 14], [0, 16], [12, 16], [0, 5], [0, 1], [2, 7], [9, 15], [4, 13], [3, 7], [1, 2], [3, 10], [7, 9], [1, 14], [15, 17], [10, 15], [14, 15], [2, 10], [9, 11], [4, 12], [6, 7], [5, 16], [10,…