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, 11 , 0, 17 , 0, 18 , 0, 21 , 0, 27 , 0, 28 , 0, 30 , 0, 31 , 0, 35 , 0, 41 , 1, 2 , 1, 3 , 1, 4 , 1, 5 , 1, 7 , 1, 8 , 1, 9 , 1, 10 …
The task
An undirected simple graph has 54 vertices labelled 0..53 and edge list [[0, 11], [0, 17], [0, 18], [0, 21], [0, 27], [0, 28], [0, 30], [0, 31], [0, 35], [0, 41], [1, 2], [1, 3], [1, 4], [1, 5], [1, 7], [1, 8], [1, 9], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [1, 18], [1, 19], [1, 20],…