|
Boost Users : |
From: Pratyush (pkprasoon_at_[hidden])
Date: 2006-04-11 04:23:11
Hi,
It seems that adjacency list takes up lot of memory than what I was expecting.
Below is the code that I used for testing.
int main()
{
typedef boost::adjacency_list<> graph_t;
graph_t g(6045064);
}
The graph populated is taking about 190MB of memory, i.e., 32 bytes/vertex
approx. I was expecting it to take 4 bytes/vertex.
Am I doing something wrong? My intent is to use "vec_adj_list_impl" having no
properties at all.
Thanks & regards,
Pratyush
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