add_pa_graph {DiagrammeR} | R Documentation |
To an existing graph object, add a graph built according to the Barabasi-Albert model, which uses preferential attachment in its stochastic algorithm.
add_pa_graph(graph, n, m = NULL, power = 1, out_dist = NULL, use_total_degree = FALSE, zero_appeal = 1, algo = "psumtree", type = NULL, label = TRUE, rel = NULL, node_aes = NULL, edge_aes = NULL, node_data = NULL, edge_data = NULL, set_seed = NULL)
graph |
a graph object of
class |
n |
the number of nodes comprising the preferential attachment graph. |
m |
the number of edges to add in each time step. |
power |
the power of the
preferential attachment. The
default value of |
out_dist |
a numeric vector that provides the distribution of the number of edges to add in each time step. |
use_total_degree |
a logical
value (default is |
zero_appeal |
a measure of the attractiveness of the nodes with no adjacent edges. |
algo |
the algorithm to use
to generate the graph. The
available options are
|
type |
an optional string that describes the entity type for all the nodes to be added. |
label |
a boolean value where
setting to |
rel |
an optional string for providing a relationship label to all edges to be added. |
node_aes |
an optional list
of named vectors comprising node
aesthetic attributes. The helper
function |
edge_aes |
an optional list
of named vectors comprising edge
aesthetic attributes. The helper
function |
node_data |
an optional list
of named vectors comprising node
data attributes. The helper
function |
edge_data |
an optional list
of named vectors comprising edge
data attributes. The helper function
|
set_seed |
supplying a value
sets a random seed of the
|
# Create an undirected PA # graph with 100 nodes, adding # 2 edges at every time step pa_graph <- create_graph( directed = FALSE) %>% add_pa_graph( n = 100, m = 1) # Get a count of nodes pa_graph %>% count_nodes() # Get a count of edges pa_graph %>% count_edges()