growing.random.game: Growing random graph generation

In igraph: Network Analysis and Visualization

Growing random graph generation

Description

growing.random.game() was renamed to sample_growing() to create a more consistent API.

Usage

growing.random.game(n, m = 1, directed = TRUE, citation = FALSE)

Arguments

n	Numeric constant, number of vertices in the graph.
m	Numeric constant, number of edges added in each time step.
directed	Logical, whether to create a directed graph.
citation	Logical. If TRUE a citation graph is created, i.e. in each time step the added edges are originating from the new vertex.

igraph documentation built on Oct. 20, 2024, 1:06 a.m.