|
Boost Users : |
Subject: Re: [Boost-users] [Graph] Newbie on A*
From: Sensei (senseiwa_at_[hidden])
Date: 2014-05-29 10:02:31
On 5/28/14, 9:30am, Sensei wrote:
> for(std::size_t v = source_node; ; v = p[v])
Dear all,
I've found the problem in stopping: the above code should start from the
destination node.
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?
Cheers!
Boost-users list run by williamkempf at hotmail.com, kalb at libertysoft.com, bjorn.karlsson at readsoft.com, gregod at cs.rpi.edu, wekempf at cox.net