Re: [Boost-users] [Graph] Newbie on A*

Subject: Re: [Boost-users] [Graph] Newbie on A*
From: Brandon Kohn (blkohn_at_[hidden])
Date: 2014-07-04 09:06:45

On 5/29/2014 10:02 AM, Sensei wrote:
> Now there's the next trick: how can I keep track of expanded edges? I
> need to stop the *current* computation if the path exceeds a certain
> length from the source, keeping looking for other solutions.
> 
> Is this possible with boost?
> 

I believe you can use the visitor interface with the graph searches.

http://www.boost.org/doc/libs/1_55_0/libs/graph/doc/AStarVisitor.html

You'll want to customize your behavior via that. You can probably find a
good example of its use either in the docs or via google.

HTH

Brandon