gnr_graph(n, p, create_using=None, seed=None)
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.
The number of nodes for the generated graph.
The redirection probability.
Graph type to create. If graph instance, then cleared before populated.
Indicator of random number generation state. See Randomness<randomness>
.
Returns the growing network with redirection (GNR) digraph with n nodes and redirection probability p.
>>> D = nx.gnr_graph(10, 0.5) # the GNR graphSee :
... G = D.to_undirected() # the undirected version
The following pages refer to to this document either explicitly or contain code examples using this.
networkx.generators.directed.gnr_graph
Hover to see nodes names; edges to Self not shown, Caped at 50 nodes.
Using a canvas is more power efficient and can get hundred of nodes ; but does not allow hyperlinks; , arrows or text (beyond on hover)
SVG is more flexible but power hungry; and does not scale well to 50 + nodes.
All aboves nodes referred to, (or are referred from) current nodes; Edges from Self to other have been omitted (or all nodes would be connected to the central node "self" which is not useful). Nodes are colored by the library they belong to, and scaled with the number of references pointing them