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: 15, 17 , 13, 22 , 4, 23 , 34, 36 , 15, 23 , 17, 22 , 3, 7 , 11, 23 , 13, 26 , 0, 21 , 8, 35 , 4, 31 …
The task
Two undirected simple graphs G1 and G2 each have 40 vertices labelled 0..39 and 507 edges. G1 edges: [[15, 17], [13, 22], [4, 23], [34, 36], [15, 23], [17, 22], [3, 7], [11, 23], [13, 26], [0, 21], [8, 35], [4, 31], [20, 25], [9, 23], [13, 27], [7, 12], [19, 28], [21, 32], [4, 15], [22, 24], [28, 29], [21, 30], [23,…