Re: [Boost-users] [BGL] Segfaults when switching from digraph to undirected graph

Subject: Re: [Boost-users] [BGL] Segfaults when switching from digraph to undirected graph
From: Andrew Sutton (andrew.n.sutton_at_[hidden])
Date: 2009-01-28 07:56:44

>
>
> I cut out most of the stuff not directly related to accessing the graph. It
> segfaults in the line marked by !!!, so it would seem that out_edges returns
> an invalid range (I did some debugging and the this line executes quite a
> few times before the iterator becomes invalid. I can't seem to force gdb to
> recognise nn1e as a symbol so I can't tell which edge/node is causing the
> problem.  All this is ran after the graph is initialised (it's quite large,
> ab. 22k nodes and 900k edges).
>
>
You should include the definition of the graph's type. There are some subtle
tradeoffs when selecting vecS vs. listS, etc.

Are you modifying the graph in any way in the code that you're omitting?

Andrew Sutton
andrew.n.sutton_at_[hidden]