Boost logo

Boost :

From: David Abrahams (david.abrahams_at_[hidden])
Date: 2002-01-14 14:11:42

I think a regular priority_queue will do the job:


----- Original Message -----
From: "Jeremy Siek" <jsiek_at_[hidden]>
To: <boost_at_[hidden]>
Sent: Monday, January 14, 2002 1:56 PM
Subject: Re: [boost] BGL experience report and question

> On Thu, 10 Jan 2002, David Abrahams wrote:
> david.>
> david.> Actually, it's not an A* search that I need. From reviewing my
> david.> algorithms, it looks like I want something more like best-first
search. I
> david.> don't think dijkstra's algorithm can be made to do that, can it?
> So for a best-first search (p. 93 of Artificial Intelligence: A Modern
> Approach by Russell and Norvig) the user provides a heuristic function
> that estimates the shortest path for a vertex, and then the algorithm
> orders the queue based on the function. I suppose it would be possible to
> use the BGL BFS with a custom-made queue to implement this.
> Cheers,
> Jeremy
> ----------------------------------------------------------------------
> Jeremy Siek
> Ph.D. Student, Indiana Univ. B'ton email: jsiek_at_[hidden]
> C++ Booster ( office phone: (812) 855-3608
> ----------------------------------------------------------------------
> Info: Send unsubscribe requests to:
> Your use of Yahoo! Groups is subject to

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