construct/rlve imp party
construct/rlve imp party: a task in MathConstructOptimize-Envs-harbor (Harbor dataset). An undirected simple graph has 9 vertices labelled 0..8 and edge list 0, 1 , 0, 5 , 0, 6 , 0, 7 , 0, 8 , 1, 2 , 1, 5 , 1, 6 , 1, 7 , 1, 8 , 2, 5 , 3, 5 , 3, 6 , 3, 7 , 4, 5 , 4, 6 , 4, 7 , 4, 8 , 5, 6 , 5, 7 …
The task
An undirected simple graph has 9 vertices labelled 0..8 and edge list [[0, 1], [0, 5], [0, 6], [0, 7], [0, 8], [1, 2], [1, 5], [1, 6], [1, 7], [1, 8], [2, 5], [3, 5], [3, 6], [3, 7], [4, 5], [4, 6], [4, 7], [4, 8], [5, 6], [5, 7], [5, 8], [6, 7], [6, 8], [7, 8]]