Growing random graph generation
This function creates a random graph by simulating its stochastic evolution.
sample_growing(n, m = 1, directed = TRUE, citation = FALSE) growing(...)
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 |
... |
Passed to |
This is discrete time step model, in each time step a new vertex is added to
the graph and m new edges are created. If citation is
FALSE these edges are connecting two uniformly randomly chosen
vertices, otherwise the edges are connecting new vertex to uniformly
randomly chosen old vertices.
A new graph object.
Gabor Csardi csardi.gabor@gmail.com
g <- sample_growing(500, citation=FALSE) g2 <- sample_growing(500, citation=TRUE)
Please choose more modern alternatives, such as Google Chrome or Mozilla Firefox.