Thank you all for the information. My python process is still running after about 17 hours!

@Tiago: I have randint(0,80) separately for incoming and outgoing edges; hence, I expect average degree of 80 (incoming + outgoing) for vertices.

On Sat, Feb 2, 2013 at 5:43 AM, Tiago de Paula Peixoto <tiago@skewed.de> wrote:
On 02/02/2013 11:30 AM, Giuseppe Profiti wrote:
> Just a suggestion: I tested webgraph for my purposes after meeting one of the developers, and I can say that the memory usage is quite amazing (in a good sense: very low).
> However, at least 1 year ago, webgraph was unfit for dynamic graphs, so if you plan to remove nodes and so on, I don't think it's the best choice.

The same is true for the compressed sparse row (CSR) graph in BGL. The
graph is essentially immutable.

I've planned to include optional CSR support in graph-tool, but I haven't
found the time yet to do so.

However, things can be improved somewhat easily in graph-tool by a
factor 2 by using 32 bit integers, instead of 64 bits. I'll keep this in
mind for future releases.

Cheers,
Tiago

--
Tiago de Paula Peixoto <tiago@skewed.de>


_______________________________________________
graph-tool mailing list
graph-tool@skewed.de
http://lists.skewed.de/mailman/listinfo/graph-tool