From: Dave Abrahams (abrahams_at_[hidden])
Date: 2000-01-12 20:32:19
> Have you looked at the dijkstra's algorithm in the graph_code? It has
> a visitor that allows you to extend it. If you need to access the
> weights in the visitor code, then just put a property accessor for it
> inside the visitor object.
I looked, but I didn't see an obvious way to do these things (which is what
I said when I started this thread). You can see the requirements of my
algorithm, now. It seems like a pretty simple example. Can you please
illustrate (in code) how to make the graph_code do what I want?
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk