From: David Abrahams (abrahams_at_[hidden])
Date: 2001-03-25 12:43:20
Yes, that's part of the technique. BTW, I think I'm just applying an idea of
Alexey Gurtovoy's, here... or rather, suggesting its application ;-)
----- Original Message -----
> --- In boost_at_y..., "David Abrahams" <abrahams_at_m...> wrote:
> > If instead, the algorithm could be invoked thus,
> > dijkstra_shortest_paths(g, start,
> > weight_map(my_weights).visitor(my_visitor))
> > the interface would be far simpler.
> This is great! The interface is much cleaner. And I think
> you also want the order of the maps and visitors to be
> irrelevant, right?
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk