A question about "prim_minimum_spanning_tree.hpp"
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.
On Fri, 20 Aug 2010, 王伟 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.
Could you please add a check when you read in the input file to be sure that the values in there are within range (i.e., edge endpoints are legal vertex numbers)? Could you also please check whether your graph has been constructed before the code seg faults and how many vertices and edges end up in it? Those might help to track down the problem. -- Jeremiah Willcock
participants (2)
-
Jeremiah Willcock -
王伟