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.