Re: [Boost-users] [astar search] Computation time for large graph

Subject: Re: [Boost-users] [astar search] Computation time for large graph
From: Yann-Hervé Hellouvry (yannherve.hellouvry_at_[hidden])
Date: 2013-01-09 11:36:51

Hi,

My compiler is in "optimization mode" and I am on a release version... If
listS could be an issue, what could I use instead for my edge container?
Regards,
YH

2013/1/9 Jeremiah Willcock <jewillco_at_[hidden]>

> On Wed, 9 Jan 2013, Yann-Hervé Hellouvry wrote:
>
> One issue could be that your graph uses listS as out edge container, but
> that shouldn't cause the search to be as slow as you're experiencing.  Are
> you sure your compiler's optimization is enabled and that NDEBUG is defined?
>
> -- Jeremiah Willcock