Re: [Boost-users] Memory usage of adjacency_list

Subject: Re: [Boost-users] Memory usage of adjacency_list
From: Jeremiah Willcock (jewillco_at_[hidden])
Date: 2012-10-24 13:03:39

On Sun, 21 Oct 2012, Ed Linde wrote:

> Hi,
> Can I please get a response about my query on how I can go about
> measuring/estimating the
> memory required by the Boost graph library for my previously posted
> adjacency_list?

I think it will depend heavily on your system; I don't know how big an 
std::list node typically is, and you are using lists for edge storage.  If 
you want to save memory for read-only graphs (the properties do not need 
to be read-only), use compressed_sparse_row_graph, which has much more 
predictable memory behavior.

-- Jeremiah Willcock