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.
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
Hi Jeremiah,
Below is the definition of my graph.
struct VertexProperties {
std::size_t index;
};
typedef boost::adjacency_list
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? Thanks, Ed -- View this message in context: http://boost.2283326.n4.nabble.com/Memory-usage-of-adjacency-list-tp4637051p... Sent from the Boost - Users mailing list archive at Nabble.com.
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
participants (2)
-
Ed Linde -
Jeremiah Willcock