Boost logo

Boost :

From: aalness_at_[hidden]
Date: 2001-01-29 10:52:39

Would it be a terrible idea to have an event filter for edge_discover
or whatever the vertex counterpart is so you could change the weights of
the edges just prior to insertion into the priority queue and avoid an
extra iteration through all the edges?

On Fri, 26 Jan 2001, Jeremy Siek wrote:

> Before calling uniform_cost_search(), you could run through all the edges
> using the edges(g) function and decide at that point which weights to
> use.
> Cheers,
> Jeremy


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