Date: 2001-01-26 09:19:19
Sorry this was an afterthought to my last email, is there a way to visit
all the edges before insertion into the priority queue?
On Fri, 26 Jan 2001 aalness_at_[hidden] wrote:
> Yes I wanted the edge weights to be dynamic in the sense that I wanted to
> keep the weights given to me by BGP but also have the option of using a
> manually given weight from another source. I thought I could do that
> durinvg the search, so I guess the only way is to actually modify the edge
> weight before doing the search? Thanks.
> On Fri, 26 Jan 2001, Jeremy Siek wrote:
> > Hi Andy,
> > I'm not sure I completely understand what you are doing, but a first
> > glance one thing strikes be as odd. Are you changing the edge weights
> > *during* the search. This will invalidate the shortest-distance properties
> > of the search because inside of uniform_cost_search(), vertices are placed
> > in a priority queue based on distance (and thereby edge weight). If you
> > change edge weights, this priority queue will no longer be accurate.
-- ---------------------- Andrew Alness Software Engineer Sonicity, Inc. aalness_at_[hidden] "I want my two dollars." -kid on bike
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk