Boost logo

Boost :

From: Dave Abrahams (abrahams_at_[hidden])
Date: 2000-01-12 20:58:55

> 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?

No, do a best-first-search and copy the original graph to a new graph. The
new graph should be an excact copy of the original, except the nodes are
labelled with their least total cost from the start node.

the point is that in a best-first-search, each edge is only traversed once.
This makes it appropriate for copying the graph, too.


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