From: Douglas Gregor (doug.gregor_at_[hidden])
Date: 2005-12-20 18:05:55
On Dec 15, 2005, at 6:19 AM, Nicola Vitacolonna wrote:
> Hi,
> how can I accurately measure the memory used by an adjacency_list
> (per node, per edge, per property, overall)?
Actually, we don't have a good way to do that... but it would be a
really great idea! We could add static methods to the adjacency_list
template to count the overhead per vertex, per edge, and per graph.
I've added this to the challenge list; perhaps someone will take a
shot at implementing it.
Doug