|
Boost Users : |
Subject: [Boost-users] Memory usage of adjacency_list
From: Ed Linde (edolinde_at_[hidden])
Date: 2012-10-13 00:24:42
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.html Sent from the Boost - Users mailing list archive at Nabble.com.
Boost-users list run by williamkempf at hotmail.com, kalb at libertysoft.com, bjorn.karlsson at readsoft.com, gregod at cs.rpi.edu, wekempf at cox.net