Subject: Re: [boost] [graph] interest in resumable dijkstra?
From: Alex Hagen-Zanker (ahh34_at_[hidden])
Date: 2012-08-09 19:08:00
On Aug 9 2012, Jeremiah Willcock wrote:
>OK. It looks like that algorithm is using longest paths (in DAGs) as well
>as shortest paths. Is that also something that you're doing?
Yes, but that part of the calculation does not require resumability. It is
from scratch each iteration. It is based on a topological sort and does not
use dijkstra shortest paths.
>Do you just use this to interleave computations, with the maps used to
>restart a shortest path search from where it left off, or are you
>manipulating the maps in some other way?
I just restart where I was left. The only thing that changes is the
termination criterion. (e.g. the weights on the edges remain the same)
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk