5.9.2. networkx.generators.directed.gnr_graph¶

networkx.generators.directed.gnr_graph(n, p, create_using=None, seed=None)[source]¶

Return the growing network with redirection (GNR) digraph with n nodes and redirection probability p.

The GNR graph is built by adding nodes one at a time with a link to one previously added node. The previous target node is chosen uniformly at random. With probabiliy p the link is instead “redirected” to the successor node of the target.

The graph is always a (directed) tree.

Parameters:	n : int The number of nodes for the generated graph. p : float The redirection probability. create_using : graph, optional (default DiGraph) Return graph of this type. The instance will be cleared. seed : hashable object, optional The seed for the random number generator.

References

[R1019]

P. L. Krapivsky and S. Redner, Organization of Growing Random Networks, Phys. Rev. E, 63, 066123, 2001.

Examples

To create the undirected GNR graph, use the to_directed() method:

>>> D = nx.gnr_graph(10, 0.5)  # the GNR graph
>>> G = D.to_undirected()  # the undirected version