|
Boost Users : |
Subject: Re: [Boost-users] Memory usage of adjacency_list
From: Jeremiah Willcock (jewillco_at_[hidden])
Date: 2012-10-13 14:59:26
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
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