pub fn barabasi_albert(n: usize, m: usize) -> Graph<(), ()>Expand description
Barabasi-Albert preferential attachment graph. Start with m+1 fully connected nodes, then add n-(m+1) nodes, each connecting to m existing nodes with probability proportional to degree.