Boost logo

Boost :

From: jsiek_at_[hidden]
Date: 2000-01-12 20:52:15

Just to make sure I know at a high level what the algorithm is
suppose to do:

Do a best-first-search, and copy the resulting tree to a new graph?

Dave Abrahams writes:
> > 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?
> Thanks,
> Dave
> ------------------------------------------------------------------------
> Want to send money instantly to anyone, anywhere, anytime?
> You can today at - and we'll give you $20 to try it! Sign
> up today at It's quick, free, & there's no obligation!
> -- Easily schedule meetings and events using the group calendar!
> --

Boost list run by bdawes at, gregod at, cpdaniel at, john at