Re: [Boost-users] Need example of substitution of priority queue

Subject: Re: [Boost-users] Need example of substitution of priority queue
From: Jeremiah Willcock (jewillco_at_[hidden])
Date: 2010-05-21 16:13:03

On Thu, 20 May 2010, Eric Fowler wrote:

> I don't see how this substitutes a hand-rolled queue.

That code I pointed to creates a queue and uses it in 
breadth_first_search.

> And I don't see why this:
>
> 		boost::bfs_visitor<null_visitor> nv;
> 		std::stack<T> q;
>
> 		breadth_first_search(graph, vertex, q, nv);
>
> Is getting me this:
>
> In file included from MyDialog.h:8,
>                 from MyDialog.cpp:2:
> ../DelaunayGraph/DelaunayGraph.h: In member function ‘Vertex
> DelaunayGraph<T>::seek_vertex_nearest_point(const POS<T>&) const [with
> T = short int]’:
> MyDialog.cpp:44:   instantiated from here
> ../DelaunayGraph/DelaunayGraph.h:214: error: no matching function for
> call to ‘breadth_first_search(const DelaunayGraph<short int>&, const
> Vertex&, std::stack<short int, std::deque<short int,
> std::allocator<short int> > >&,
> boost::bfs_visitor<boost::null_visitor>&)’
> make: *** [MyDialog.o] Error 1

It appears that the version of breadth_first_search that takes an explicit 
queue without using named parameters needs an explicitly specified color 
map as well.

-- Jeremiah Willcock