I use boost 1.46.1 The full error code is too long, so I did not put it. It looks like color map needs to know the number of vertices (so expecting a vector): The full error message is here ------ Build started: Project: implicit_astar, Configuration: Debug Win32 ------ 1> implicit_astar_test1.cpp 1>c:\program files (x86)\boost\boost_1_46_1\boost\property_map\property_map.hpp(361): error C2106: '=' : left operand must be l-value 1> c:\program files (x86)\boost\boost_1_46_1\boost\graph\breadth_first_search.hpp(72) : see reference to function template instantiation 'void boost::put<boost::vec_adj_list_vertex_id_map<Property,Vertex>,Vertex,unsigned int,boost::default_color_type>(const boost::put_get_helper<Reference,LvaluePropertyMap> &,K,const V &)' being compiled 1> with 1> [ 1> Property=boost::property<boost::vertex_color_t,boost::default_color_type,boost::property<boost::vertex_rank_t,unsigned int,boost::property<boost::vertex_distance_t,unsigned int,boost::property<boost::vertex_predecessor_t,unsigned int,boost::property<vertex_puzzle_state_t,puzzle_state_t,boost::property<boost::vertex_index_t,unsigned int>>>>>>, 1> Vertex=unsigned int, 1> Reference=unsigned int, 1> LvaluePropertyMap=boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t,boost::default_color_type,boost::property<boost::vertex_rank_t,unsigned int,boost::property<boost::vertex_distance_t,unsigned int,boost::property<boost::vertex_predecessor_t,unsigned int,boost::property<vertex_puzzle_state_t,puzzle_state_t,boost::property<boost::vertex_index_t,unsigned int>>>>>>,unsigned int>, 1> K=unsigned int, 1> V=boost::default_color_type 1> ] 1> c:\program files (x86)\boost\boost_1_46_1\boost\graph\astar_search.hpp(260) : see reference to function template instantiation 'void boost::breadth_first_visit<VertexListGraph,MutableQueue,boost::detail::astar_bfs_visitor<AStarHeuristic,UniformCostVisitor,UpdatableQueue,PredecessorMap,CostMap,DistanceMap,WeightMap,ColorMap,BinaryFunction,BinaryPredicate>,ColorMap>(const IncidenceGraph &,unsigned int,Buffer &,BFSVisitor,ColorMap)' being compiled 1> with 1> [ 1> VertexListGraph=graph_t, 1> AStarHeuristic=manhattan_dist, 1> UniformCostVisitor=puzzle_visitor<vertex_t>, 1> UpdatableQueue=MutableQueue, 1> PredecessorMap=boost::vec_adj_list_vertex_property_map<graph_t,graph_t *,unsigned int,unsigned int &,boost::vertex_predecessor_t>, 1> CostMap=boost::vec_adj_list_vertex_property_map<graph_t,graph_t *,unsigned int,unsigned int &,boost::vertex_rank_t>, 1> DistanceMap=boost::vec_adj_list_vertex_property_map<graph_t,graph_t *,unsigned int,unsigned int &,boost::vertex_distance_t>, 1> WeightMap=boost::adj_list_edge_property_map<boost::undirected_tag,unsigned int,unsigned int &,unsigned int,boost::property<boost::edge_weight_t,unsigned int>,boost::edge_weight_t>, 1> ColorMap=boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t,boost::default_color_type,boost::property<boost::vertex_rank_t,unsigned int,boost::property<boost::vertex_distance_t,unsigned int,boost::property<boost::vertex_predecessor_t,unsigned int,boost::property<vertex_puzzle_state_t,puzzle_state_t,boost::property<boost::vertex_index_t,unsigned int>>>>>>,unsigned int>, 1> BinaryFunction=boost::closed_plus<D>, 1> BinaryPredicate=std::less<D>, 1> IncidenceGraph=graph_t, 1> Buffer=MutableQueue, 1> BFSVisitor=boost::detail::astar_bfs_visitor<manhattan_dist,puzzle_visitor<vertex_t>,MutableQueue,boost::vec_adj_list_vertex_property_map<graph_t,graph_t *,unsigned int,unsigned int &,boost::vertex_predecessor_t>,boost::vec_adj_list_vertex_property_map<graph_t,graph_t *,unsigned int,unsigned int &,boost::vertex_rank_t>,boost::vec_adj_list_vertex_property_map<graph_t,graph_t *,unsigned int,unsigned int &,boost::vertex_distance_t>,boost::adj_list_edge_property_map<boost::undirected_tag,unsigned int,unsigned int &,unsigned int,boost::property<boost::edge_weight_t,unsigned int>,boost::edge_weight_t>,boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t,boost::default_color_type,boost::property<boost::vertex_rank_t,unsigned int,boost::property<boost::vertex_distance_t,unsigned int,boost::property<boost::vertex_predecessor_t,unsigned int,boost::property<vertex_puzzle_state_t,puzzle_state_t,boost::property<boost::vertex_index_t,unsigned int>>>>>>,unsigned int>,boost::closed_plus<D>,std::less<D>> 1> ] 1> c:\program files (x86)\boost\boost_1_46_1\boost\graph\astar_search.hpp(373) : see reference to function template instantiation 'void boost::astar_search_no_init<VertexListGraph,AStarHeuristic,const Arg,boost::vec_adj_list_vertex_property_map<Graph,GraphPtr,ValueType,Reference,Tag>,boost::vec_adj_list_vertex_property_map<Graph,GraphPtr,ValueType,Reference,boost::vertex_rank_t>,boost::vec_adj_list_vertex_property_map<Graph,GraphPtr,ValueType,Reference,boost::vertex_distance_t>,boost::adj_list_edge_property_map<Directed,Value,Ref,Vertex,Property,boost::edge_weight_t>,boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t,T,Base>,Vertex>,boost::vec_adj_list_vertex_property_map<Graph,GraphPtr,boost::default_color_type,boost::default_color_type &,boost::vertex_color_t>,const Default,boost::closed_plus<D>,unsigned int,unsigned int>(const VertexListGraph &,unsigned int,AStarHeuristic,AStarVisitor,PredecessorMap,CostMap,DistanceMap,WeightMap,ColorMap,VertexIndexMap,CompareFunction,CombineFunction,CostInf,CostZero)' being compiled 1> with 1> [ 1> VertexListGraph=graph_t, 1> AStarHeuristic=manhattan_dist, 1> Arg=const puzzle_visitor<vertex_t>, 1> Graph=graph_t, 1> GraphPtr=graph_t *, 1> ValueType=unsigned int, 1> Reference=unsigned int &, 1> Tag=boost::vertex_predecessor_t, 1> Directed=boost::undirected_tag, 1> Value=unsigned int, 1> Ref=unsigned int &, 1> Vertex=unsigned int, 1> Property=boost::property<boost::edge_weight_t,unsigned int>, 1> T=boost::default_color_type, 1> Base=boost::property<boost::vertex_rank_t,unsigned int,boost::property<boost::vertex_distance_t,unsigned int,boost::property<boost::vertex_predecessor_t,unsigned int,boost::property<vertex_puzzle_state_t,puzzle_state_t,boost::property<boost::vertex_index_t,unsigned int>>>>>, 1> Default=const std::less<D>, 1> AStarVisitor=const puzzle_visitor<vertex_t>, 1> PredecessorMap=const boost::vec_adj_list_vertex_property_map<graph_t,graph_t *,unsigned int,unsigned int &,boost::vertex_predecessor_t>, 1> CostMap=boost::vec_adj_list_vertex_property_map<graph_t,graph_t *,unsigned int,unsigned int &,boost::vertex_rank_t>, 1> DistanceMap=boost::vec_adj_list_vertex_property_map<graph_t,graph_t *,unsigned int,unsigned int &,boost::vertex_distance_t>, 1> WeightMap=boost::adj_list_edge_property_map<boost::undirected_tag,unsigned int,unsigned int &,unsigned int,boost::property<boost::edge_weight_t,unsigned int>,boost::edge_weight_t>, 1> ColorMap=boost::vec_adj_list_vertex_id_map<boost::property<boost::vertex_color_t,boost::default_color_type,boost::property<boost::vertex_rank_t,unsigned int,boost::property<boost::vertex_distance_t,unsigned int,boost::property<boost::vertex_predecessor_t,unsigned int,boost::property<vertex_puzzle_state_t,puzzle_state_t,boost::property<boost::vertex_index_t,unsigned int>>>>>>,unsigned int>, 1> VertexIndexMap=boost::vec_adj_list_vertex_property_map<graph_t,graph_t *,boost::default_color_type,boost::default_color_type &,boost::vertex_color_t>, 1> CompareFunction=const std::less<D>, 1> CombineFunction=const boost::closed_plus<D>, 1> CostInf=const std::numeric_limits<unsigned int>::_Ty, 1> CostZero=const D 1> ] 1> c:\cppprojects\implicit_astar\implicit_astar\implicit_astar_test1.cpp(269) : see reference to function template instantiation 'void boost::astar_search_no_init<graph_t,manhattan_dist,RankMap,boost::vertex_rank_t,boost::bgl_named_params<T,Tag,Base>>(const VertexListGraph &,unsigned int,AStarHeuristic,const boost::bgl_named_params<RankMap,boost::vertex_rank_t,boost::bgl_named_params<T,Tag,Base>> &)' being compiled 1> with 1> [ 1> T=ColorMap, 1> Tag=boost::vertex_color_t, 1> Base=boost::bgl_named_params<DistanceMap,boost::vertex_distance_t,boost::bgl_named_params<PredMap,boost::vertex_predecessor_t,boost::bgl_named_params<WeightMap,boost::edge_weight_t,boost::bgl_named_params<IndexMap,boost::vertex_index_t,boost::bgl_named_params<puzzle_visitor<vertex_t>,boost::graph_visitor_t,boost::no_property>>>>>, 1> VertexListGraph=graph_t, 1> AStarHeuristic=manhattan_dist 1> ] ========== Build: 0 succeeded, 1 failed, 0 up-to-date, 0 skipped ========== On Wed, Jul 20, 2011 at 8:09 PM, Jeremiah Willcock <jewillco@osl.iu.edu>wrote:
On Wed, 20 Jul 2011, anilpanicker wrote:
I'm trying to compile the puzzle 8 given in this link
using astar_search_no_init()
but I get this error "error C2106: '=' : left operand must be l-value" I'm using VS2010. Can someone please help me
What is the full error message you get, including the instantiation stack? Which version of Boost are you using?
-- Jeremiah Willcock ______________________________**_________________ Boost-users mailing list Boost-users@lists.boost.org http://lists.boost.org/**mailman/listinfo.cgi/boost-**users<http://lists.boost.org/mailman/listinfo.cgi/boost-users>