2.12. igraph_establishment_game — Generates a graph with a simple growing model with vertex types.

2.12. `igraph_establishment_game` — Generates a graph with a simple growing model with vertex types.

int igraph_establishment_game(igraph_t *graph, igraph_integer_t nodes,
			      igraph_integer_t types, igraph_integer_t k,
			      igraph_vector_t *type_dist,
			      igraph_matrix_t *pref_matrix,
			      igraph_bool_t directed);

The simulation goes like this: a single vertex is added at each time step. This new vertex tries to connect to k vertices in the graph. The probability that such a connection is realized depends on the types of the vertices involved.

Arguments:

`graph`:	Pointer to an uninitialized graph.
`nodes`:	The number of vertices in the graph.
`types`:	The number of vertex types.
`k`:	The number of connections tried in each time step.
`type_dist`:	Vector giving the distribution of vertex types.
`pref_matrix`:	Matrix giving the connection probabilities for different vertex types.
`directed`:	Logical, whether to generate a directed graph.

Returns:

Error code.

Added in version 0.2.

Time complexity: O(|V|*k*log(|V|)), |V| is the number of vertices and k is the k parameter.