18 Jul
2012
18 Jul
'12
2:03 p.m.
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: http://people.pwf.cam.ac.uk/ahh34/dijkstra.zip Kind regards, Alex