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