Re: [Boost-users] A question about "prim_minimum_spanning_tree.hpp"

Subject: Re: [Boost-users] A question about "prim_minimum_spanning_tree.hpp"
From: Stephen Woodbridge (woodbri_at_[hidden])
Date: 2010-08-27 11:39:00

On 8/27/2010 4:52 AM, 王伟 wrote:
> Hi,
> I'm studying MST algorithms in GPU recently.I need BGL implementation as
> coparison,But I have a problem in
> using  prim_minimum_spanning_tree.hpp.The problem is:when I use large
> input(e.g. >1M),there's a "segmnetation error" problem.But when the
> input(e.g. 1K) is small,the result is noproblem. I haven't found know
> the reason yet.My complier is gcc 4.1.2,OS is RHEL5.
> Help would be appreciated. Thanks in advance.
> Wang wei
> The complete code is in the attachment.

There are a couple of things that would be helpful to try and report:

1) run your executable in gdb

gdb ./BGLPrim
run <arguments>
backtrace
quit

and report the backtrace output.

2) run your code under valgrind

valgrind --leak-check=summary ./BGLPrim <arguments>

This will run slower, but will print out some information at the end of 
the execution that might also be very helpful.

-Steve