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