construct/rlve maximum clique
construct/rlve maximum clique: a task in MathConstructOptimize-Envs-harbor (Harbor dataset). An undirected simple graph has 22 vertices labelled 0..21 and edge list 0, 1 , 0, 2 , 0, 3 , 0, 4 , 0, 5 , 0, 6 , 0, 9 , 0, 10 , 0, 11 , 0, 12 , 0, 14 , 0, 16 , 0, 17 , 0, 19 , 0, 20 , 1, 3 , 1, 4 , 1, 5 …
The task
An undirected simple graph has 22 vertices labelled 0..21 and edge list [[0, 1], [0, 2], [0, 3], [0, 4], [0, 5], [0, 6], [0, 9], [0, 10], [0, 11], [0, 12], [0, 14], [0, 16], [0, 17], [0, 19], [0, 20], [1, 3], [1, 4], [1, 5], [1, 8], [1, 9], [1, 10], [1, 13], [1, 14], [1, 15], [1, 16], [1, 17], [2, 3], [2, 6], [2, 7],…