Re: [Boost-users] [BGL] what is the "Power-Law Out Degree" algorithm?

From: Doug Gregor (dgregor_at_[hidden])
Date: 2005-09-07 13:40:26

On Sep 7, 2005, at 12:51 PM, Rui Carvalho wrote:
> Thanks for this. Just out of curiosity, what were the reasons to 
> choose this
> particular power-law generator?

It doesn't rely on alternately adding vertices then edges. Because it 
starts with a fixed number of vertices and adds edges from there, it's 
easier to construct a graph with "n" vertices and then have the 
generator create only the edges. That fits well with the adjacency_list 
constructors (both in the BGL and for our distributed adjacency list in 
the Parallel BGL).

>  Shouldn't the BGL also target more accepted
> algorithms like the Barabasi-Albert?

If someone provides an implementation, we'd be happy to review and 
integrate it. The BGL expands in a very demand-driven way: we add 
components when we need them or when someone else provides them. PLOD 
came from our need to generate really big distributed graphs to 
test/benchmark on.

> I mean, the PLOD model does not really stand shoulder to shoulder with 
> the
> small word and erdos-renyi, does it?

It's not as popular, no, but that doesn't mean it isn't worthy :) Does 
is generate graphs poorly?

        Doug