3.3. igraph_motifs_randesu_estimate — Estimate the total number of motifs in a graph

3.3. `igraph_motifs_randesu_estimate` — Estimate the total number of motifs in a graph

int igraph_motifs_randesu_estimate(const igraph_t *graph, igraph_integer_t *est,
				   int size, const igraph_vector_t *cut_prob, 
				   igraph_integer_t sample_size, 
				   const igraph_vector_t *parsample);

This function is useful for large graphs for which it is not feasible to count all the different motifs, because there is very many of them.

The total number of motifs is estimated by taking a sample of vertices and counts all motifs in which these vertices are included. (There is also a cut_prob parameter which gives the probabilities to cut a branch of the search tree.)

Directed motifs will be counted in directed graphs and undirected motifs in undirected graphs.

Arguments:

`graph`:	The graph object to study.
`est`:	Pointer to an integer type, the result will be stored here.
`size`:	The size of the motif to look for.
`cut_prob`:	Vector giving the probabilities to cut a branch of the search tree and omit counting the motifs in that branch. It contains a probability for each level. Supply `size` zeros here to count all the motifs in the sample.
`sample_size`:	The number of vertices to use as the sample. This parameter is only used if the `parsample` argument is a null pointer.
`parsample`:	Either pointer to an initialized vector or a null pointer. If a vector then the vertex ids in the vector are used as a sample. If a null pointer then the `sample_size` argument is used to create a sample of vertices drawn with uniform probability.

Returns:

Error code.

Time complexity: TODO.