Boost logo

Boost :

From: aalness_at_[hidden]
Date: 2001-01-29 11:40:40


Oh, I didn't realize examine_edge() was called before priority queue
insertion, well then I could just adjust the weight then correct?
Or would that invalidate the search?

-Andy

On Mon, 29 Jan 2001, Jeremy Siek wrote:

>
> So you want the edge weights to be "initialized" in a lazy fashion... This
> sounds possible. This was what you were trying to do in your previous
> post, yes? I didn't really understand before... I think using
> examine_edge() should work, since each edge is examined once during the
> algorithm before being inserted into the queue. Could you send me a simple
> but complete example (about 1 page) that I can play with?
>
> Cheers,
> Jeremy
>
>
> On Mon, 29 Jan 2001 aalness_at_[hidden] wrote:
>
> aalnes>
> aalnes> Would it be a terrible idea to have an event filter for edge_discover
> aalnes> or whatever the vertex counterpart is so you could change the weights of
> aalnes> the edges just prior to insertion into the priority queue and avoid an
> aalnes> extra iteration through all the edges?
> aalnes>
> aalnes> On Fri, 26 Jan 2001, Jeremy Siek wrote:
> aalnes>
> aalnes> >
> aalnes> > Before calling uniform_cost_search(), you could run through all the edges
> aalnes> > using the edges(g) function and decide at that point which weights to
> aalnes> > use.
> aalnes> >
> aalnes> > Cheers,
> aalnes> > Jeremy
> aalnes>
> aalnes> -Andy
> aalnes>
> aalnes>
> aalnes>
> aalnes>
> aalnes>
>
> ----------------------------------------------------------------------
> Jeremy Siek www: http://www.lsc.nd.edu/~jsiek/
> Ph.D. Candidate email: jsiek_at_[hidden]
> Univ. of Notre Dame work phone: (219) 631-3906
> ----------------------------------------------------------------------
>
>
>
>
>
>

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