From: David Abrahams (dave_at_[hidden])
Date: 2006-10-14 16:28:32
"Wolfram Koska" <koskaw_at_[hidden]> writes:
> Hi,
>
> I would like to know if there is any info on how much memory boost graph's
> Nodes and Edges consume (assuming listS)? I searched, but didn't find
> anything about this. I don't need exact values, a good estimate would be
> sufficient (to be able to predict the memory consumption of graphs with a
> huge number of nodes and edges).
I don't know, but FWIW, BGL's generic design means that it can work
with your own graph structures if you think you can do better than
adjacency_list does.
-- Dave Abrahams Boost Consulting www.boost-consulting.com