Subject: Re: [boost] [graph] interest in resumable dijkstra?
From: Alex Hagen-Zanker (ahh34_at_[hidden])
Date: 2012-07-24 16:40:59
On 16/07/2012 20:48, Jeremiah Willcock wrote:
> On Mon, 16 Jul 2012, Alex Hagen-Zanker wrote:
>> On 13/07/2012 19:24, Jeremiah Willcock wrote:
>>> On Fri, 13 Jul 2012, Alex Hagen-Zanker wrote:
>>>> I placed the BGL algorithm of the dijkstra_shortest_path in a
>>>> class, with the creation and initialization part separate from the
>>>> main algorithm. This allows interrupting, resetting and resuming
>>>> the algorithm. Would this be of interest to anybody?
>>> Yes, definitely.
> OK, but please remind me early next week if I haven't sent a response
> by then.
Did you have a chance to look at the code? It is now at a stage where it
won't progress unless I get feedback from you or others.
The latest version is here: http://people.pwf.cam.ac.uk/ahh34/dijkstra.zip
Kind regards, Alex
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk