Re: [Boost-users] High memory requirement of adjacency_list

From: Sebastian Weber (sebastian.weber_at_[hidden])
Date: 2006-04-11 13:46:43

Hi!

> The next release of the Graph library will have the  
> compressed_sparse_row_graph graph type, which requires much less  
> memory than adjacency_list. Naturally, it's also less flexible.

When will this stuff be released? What do you mean by less flexible and
what graph sizes are manageable with this kind of graph on a 32-bit
machine with sparse graph as <k>=3 ?? 1e8, 1e9 ??

Sorry for beeing so curious. But anyway: How does this
compressed_sparse_row_graph thing work?

Sebastian

> 
> 	Doug
> _______________________________________________
> Boost-users mailing list
> Boost-users_at_[hidden]
> http://lists.boost.org/mailman/listinfo.cgi/boost-users