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: Grzegorz Slodkowicz (jergosh_at_[hidden])
Date: 2009-01-28 09:34:52

On 28 Jan 2009, at 13:56, Andrew Sutton wrote:

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

Please disregard my previous message. Debugger sent me on a wild goose  
chase, the problem was in fact with property maps. Sorry about that.

Regards,
Greg