13 Oct
2012
13 Oct
'12
6:59 p.m.
On Fri, 12 Oct 2012, Ed Linde wrote:
Hi, Is it possible to get a ballpark figure of the maximum memory required for an adjacency_list, given its settings? I need these statistics to report how much memory is being used initially when reading in a large graph and then after vertex removal operations and edge removal operations, how much reduction is got in this memory finally. Do I have to write something of my own to do this?
What containers are you using (vecS, listS, setS, etc.) for the various storage types? That will greatly affect the amount of memory that is used. -- Jeremiah Willcock