
12 Oct
2012
12 Oct
'12
10:24 p.m.
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? Thanks, Ed -- View this message in context: http://boost.2283326.n4.nabble.com/Memory-usage-of-adjacency-list-tp4637051.... Sent from the Boost - Users mailing list archive at Nabble.com.