From: Wolfram Koska (koskaw_at_[hidden])
Date: 2006-10-12 10:37:13


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).

Thanks in advance,
Wolfram Koska

P.S.: While I'm at it, is there any native way to check if a node/edge is
still in a graph?