Return the GNC digraph with n nodes.
The GNC (growing network with copying) graph is built by adding nodes one at a time with a links to one previously added node (chosen uniformly at random) and to all of that node’s successors.
Parameters: | n : int
create_using : graph, optional (default DiGraph)
seed : hashable object, optional
|
---|
References
[R57] | P. L. Krapivsky and S. Redner, Network Growth by Copying, Phys. Rev. E, 71, 036118, 2005k.}, |