Return the GNC (growing network with copying) digraph with n nodes.
The 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.
Reference:
@article{krapivsky-2005-network,
title = {Network Growth by Copying},
author = {P. L. Krapivsky and S. Redner},
journal = {Phys. Rev. E},
volume = {71},
pages = {036118},
year = {2005},
}