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