2.4. igraph_independence_number — Find the independence number of the graph

int igraph_independence_number(const igraph_t *graph, igraph_integer_t *no);

The independence number of a graph is the cardinality of the largest independent vertex set.

Arguments:

`graph`:	The input graph.
`no`:	The independence number will be returned to the `igraph_integer_t` pointed by this variable.

Returns:

Error code.

See also:

igraph_independent_vertex_sets().

Time complexity: TODO.