1.1. igraph_cliques — Find all or some cliques in a graph

int igraph_cliques(const igraph_t *graph, igraph_vector_ptr_t *res,
                   igraph_integer_t min_size, igraph_integer_t max_size);

Cliques are fully connected subgraphs of a graph.

If you are only interested in the size of the largest clique in the graph, use igraph_clique_number() instead.

Arguments:

`graph`:	The input graph.
`res`:	Pointer to a pointer vector, the result will be stored here, ie. `res` will contain pointers to `igraph_vector_t` objects which contain the indices of vertices involved in a clique. The pointer vector will be resized if needed but note that the objects in the pointer vector will not be freed.
`min_size`:	Integer giving the minimum size of the cliques to be returned. If negative or zero, no lower bound will be used.
`max_size`:	Integer giving the maximum size of the cliques to be returned. If negative or zero, no upper bound will be used.

Returns:

Error code.

Time complexity: TODO