Boost logo

Boost Users :

From: duccio.medini_at_[hidden]
Date: 2003-12-12 10:01:34

Thx a lot for your help.

Giving a look in the CVS I've found a "Nonrecursive version" of the depth_first_search.hpp
. It should fix a problem in the Stack generated in the boost 1.30.2 version
(that I was using).

Since substituting the old implementation with this new file perfectly fixed
my problem (the code now uses less RAM and is perfectly stable also with
my largest network), I conclude that I was experiencing exactly that Stack
bug in the routine.

Thanks again, and especially thanks A LOT to Bruce Barr who wrote the new


>-- Messaggio originale --
>Date: Fri, 12 Dec 2003 09:24:13 -0500 (EST)
>From: Jeremy Siek <jsiek_at_[hidden]>
>To: Boost Users mailing list <boost-users_at_[hidden]>
>Subject: Re: [Boost-users] newbie BGL problem: core dump due to graph size
>Reply-To: Boost Users mailing list <boost-users_at_[hidden]>
>Hi Duccio,
>The only intrinsic size limitations, say for adjacency_list, that I am
>aware of are in the range of numbers representable by an "int". As for
>algorithms, I am not aware of any size limitations. Of course, there's
>always the possibility of a bug in there somewhere...
>On Thu, 11 Dec 2003 duccio.medini_at_[hidden] wrote:
>duccio> Hi all.
>duccio> I am calculating the connected components of af graph with a c++
>duccio> written with BGL.
>duccio> My graph is huge (4E+05 vertexes, 10^6 ~ 10^8 edges).
>duccio> The code uses the connected_components algorithm (or, in a different
>duccio> version, directly the depth_first_visit one) and works well up
>duccio> "reasonable" number of edges in the graph.
>duccio> Over this threshold it core dumps.
>duccio> I have the same problem both on SPARC Solaris 9 g++3.2.2 and on
>duccio> 2.4 g++3.1 .
>duccio> I know that it should not be a problem of the RAM memory available
>on the
>duccio> system (or addressable form a single istance). I am able to use
>to 6-7
>duccio> GBs of RAM, and it tipically core dumps at 2.5-5 GBs.
>duccio> I suspect that I'm violating some intrinsic size limit in the BGL
>duccio> adjacency_list class or similar.
>duccio> Are there such limits, and can they be extended?
>duccio> Any clue would be really appreciated.
>duccio> Thanks in advance!
>duccio> Duccio Medini
> Jeremy Siek
> Ph.D. Student, Indiana Univ. B'ton email: jsiek_at_[hidden]
> C++ Booster ( office phone: (812) 856-1820
>Boost-users mailing list

Boost-users list run by williamkempf at, kalb at, bjorn.karlsson at, gregod at, wekempf at