On Wed, Jul 14, 2010 at 3:16 PM, Jeremiah Willcock
On Wed, 14 Jul 2010, W.P. McNeill wrote:
I verified the documentation changes for grid graph indexing calls and A*
visitors. Looks good. Now doing edge weights with a static_property_map<>.
OK.
I've duplicated relevant information from the README at the top of
maze.cpp, so README doesn't need to be included in the Boost examples.
I found that I have to implement my own vertex index map, though I'm not sure exactly why. If I remove all my vertex index map code and call A* with the default map like so:
astar_search(m_barrier_grid, source(), heuristic, boost::weight_map(weight). predecessor_map(pred_pmap). distance_map(dist_pmap). visitor(visitor) );
I get the following error:
(snip)
That is a bug in astar_search(). Please try with the latest Boost trunk and see if it works. I also added named parameters to astar_search_no_init().
Change r64024 looks like it introduced a regression. I now get the following build error in astar-maze that wasn't there before:
g++ -g -I/src/boost-trunk -Wall -Werror -O3 -c -o astar_maze.o
astar_maze.cpp
/src/boost-trunk/boost/graph/astar_search.hpp: In function ‘void
boost::astar_search(const VertexListGraph&, typename
boost::graph_traits<G>::vertex_descriptor, AStarHeuristic, const
boost::bgl_named_params
I was surprised by this because I expected the filtered graph to inherit
the grid graph's vertex index map like you describe.
That is what it should do.
-- Jeremiah Willcock _______________________________________________ Boost-users mailing list Boost-users@lists.boost.org http://lists.boost.org/mailman/listinfo.cgi/boost-users