27 Aug
2010
27 Aug
'10
3:43 p.m.
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.
Can you post you test files somewhere that we can download them? Probably NOT a good idea to post then to the list if they are large. -Steve