construct/rlve imp party
construct/rlve imp party: a task in MathConstructOptimize-Envs-harbor (Harbor dataset). An undirected simple graph has 36 vertices labelled 0..35 and edge list 0, 1 , 0, 3 , 0, 4 , 0, 5 , 0, 7 , 0, 9 , 0, 10 , 0, 11 , 0, 14 , 0, 15 , 0, 16 , 0, 17 , 0, 18 , 0, 26 , 0, 27 , 0, 28 , 0, 33 , 0, 34 …
The task
An undirected simple graph has 36 vertices labelled 0..35 and edge list [[0, 1], [0, 3], [0, 4], [0, 5], [0, 7], [0, 9], [0, 10], [0, 11], [0, 14], [0, 15], [0, 16], [0, 17], [0, 18], [0, 26], [0, 27], [0, 28], [0, 33], [0, 34], [0, 35], [1, 2], [1, 3], [1, 4], [1, 5], [1, 6], [1, 7], [1, 8], [1, 9], [1, 10], [1,…