construct/rlve imp party
construct/rlve imp party: a task in MathConstructOptimize-Envs-harbor (Harbor dataset). An undirected simple graph has 54 vertices labelled 0..53 and edge list 0, 5 , 0, 16 , 0, 17 , 0, 33 , 0, 43 , 1, 2 , 1, 3 , 1, 5 , 1, 6 , 1, 7 , 1, 9 , 1, 12 , 1, 13 , 1, 14 , 1, 15 , 1, 16 , 1, 17 , 1, 19 …
The task
An undirected simple graph has 54 vertices labelled 0..53 and edge list [[0, 5], [0, 16], [0, 17], [0, 33], [0, 43], [1, 2], [1, 3], [1, 5], [1, 6], [1, 7], [1, 9], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 19], [1, 22], [1, 23], [1, 25], [1, 26], [1, 27], [1, 28], [1, 29], [1, 31], [1, 33], [1, 38],…