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, 2 , 0, 3 , 0, 4 , 0, 5 , 0, 6 , 0, 7 , 0, 8 , 1, 4 , 2, 3 , 2, 4 , 2, 5 , 2, 7 , 2, 8 , 3, 4 , 3, 6 , 3, 7 , 3, 8 , 4, 6 , 4, 7 …
The task
An undirected simple graph has 9 vertices labelled 0..8 and edge list [[0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 7], [0, 8], [1, 4], [2, 3], [2, 4], [2, 5], [2, 7], [2, 8], [3, 4], [3, 6], [3, 7], [3, 8], [4, 6], [4, 7], [4, 8], [5, 7], [5, 8], [6, 7], [7, 8]]