Clique#
A clique in an undirected graph G = (V, E) is a subset of the vertex set such that for every two vertices in C there exists an edge connecting the two.

|
Returns an approximate maximum clique. |
|
Returns the number of vertices in the maximum clique of a graph. |
|
Determines whether the given nodes form a clique. |