Return random graph using Barabási-Albert preferential attachment model.
A graph of n nodes is grown by attaching new nodes each with m edges that are preferentially attached to existing nodes with high degree.
n : int
m : int
seed : int, optional
G : Graph
The initialization is a graph with with m nodes and no edges.
|[R228]||A. L. Barabási and R. Albert “Emergence of scaling in random networks”, Science 286, pp 509-512, 1999.|