Boost Users :
Date: 2003-12-11 12:03:05
I am calculating the connected components of af graph with a c++ code
written with BGL.
My graph is huge (4E+05 vertexes, 10^6 ~ 10^8 edges).
The code uses the connected_components algorithm (or, in a different
version, directly the depth_first_visit one) and works well up to a
"reasonable" number of edges in the graph.
Over this threshold it core dumps.
I have the same problem both on SPARC Solaris 9 g++3.2.2 and on Intel Linux
2.4 g++3.1 .
I know that it should not be a problem of the RAM memory available on the
system (or addressable form a single istance). I am able to use up to 6-7
GBs of RAM, and it tipically core dumps at 2.5-5 GBs.
I suspect that I'm violating some intrinsic size limit in the BGL
adjacency_list class or similar.
Are there such limits, and can they be extended?
Any clue would be really appreciated.
Thanks in advance!
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