Prev Up Home igraph Reference Manual Next

2.2. igraph_largest_independent_vertex_sets — Finds the largest independent vertex set(s) in a graph.

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

An independent vertex set is largest if there is no other independent vertex set with more vertices in the graph.

Arguments: 

graph:

The input graph.

res:

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

Returns: 

Error code.

See also: 

igraph_independent_vertex_sets(), igraph_maximal_independent_vertex_sets().

Time complexity: TODO

<< 2.1. igraph_independent_vertex_sets — Find all independent vertex sets in a graph 2.3. igraph_maximal_independent_vertex_sets — Find all maximal independent vertex sets of a graph >>