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, 3 , 0, 5 , 0, 8 , 0, 15 , 0, 22 , 0, 31 , 0, 36 , 0, 37 , 0, 42 , 0, 48 , 1, 2 , 1, 3 , 1, 5 , 1, 7 , 1, 8 , 1, 10 , 1, 11 , 1, 12 , 1…
The task
An undirected simple graph has 54 vertices labelled 0..53 and edge list [[0, 3], [0, 5], [0, 8], [0, 15], [0, 22], [0, 31], [0, 36], [0, 37], [0, 42], [0, 48], [1, 2], [1, 3], [1, 5], [1, 7], [1, 8], [1, 10], [1, 11], [1, 12], [1, 13], [1, 14], [1, 15], [1, 17], [1, 18], [1, 20], [1, 22], [1, 24], [1, 25], [1, 26],…