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

Subject: Re: [Boost-users] [astar search] Computation time for large graph
From: Jeremiah Willcock (jewillco_at_[hidden])
Date: 2013-01-09 14:27:05

On Wed, 9 Jan 2013, Yann-Hervé Hellouvry wrote:

> 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?

vecS is the usual option for performance when the graph doesn't change 
often.  You can also use compressed_sparse_row_graph if it doesn't change 
at all after construction.

-- Jeremiah Willcock