Prev Up Home igraph Reference Manual Next

1.2. igraph_largest_cliques — Finds the largest clique(s) in a graph.

int igraph_largest_cliques(const igraph_t *graph, igraph_vector_ptr_t *res);

A clique is largest (quite intuitively) if there is no other clique in the graph which contains more vertices.

Note that this is not neccessarily the same as a maximal clique, ie. the largest cliques are always maximal but a maximal clique is not always largest.

Arguments: 

graph:

The input graph.

res:

Pointer to an initialized pointer vector, the result will be stored here. It will be resized as needed.

Returns: 

Error code.

See also: 

igraph_cliques(), igraph_maximal_cliques()

Time complexity: TODO.

<< 1.1. igraph_cliques — Find all or some cliques in a graph 1.3. igraph_maximal_cliques — Find all maximal cliques of a graph >>