Subject: Re: [boost] [graph] interest in resumable dijkstra?
From: Alex Hagen-Zanker (ahh34_at_[hidden])
Date: 2012-07-18 10:03:29
On 17/07/2012 22:42, Tim Keitt wrote:
> Might be nice to have some simple wrappers for the most common cases
> (eg finding single s-t shortest path). Another useful one would be to
> label the vertices by nearest origin in the case of multiple origins
> (we encounter this all the time). THK
Thanks, good suggestion. I have added four wrapping functions:
- for a specific maximum distance
- reaching a specific set of targets
- the nearest origin for multiple origins
- plain dijkstra.
They are in the dijkstra_functions.hpp file, in the following archive:
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