I use boost 1.46.1<div><br></div><div>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):</div><div>The full error message is here</div>
<div><br></div><div><div>------ Build started: Project: implicit_astar, Configuration: Debug Win32 ------</div><div>1&gt;  implicit_astar_test1.cpp</div><div>1&gt;c:\program files (x86)\boost\boost_1_46_1\boost\property_map\property_map.hpp(361): error C2106: &#39;=&#39; : left operand must be l-value</div>
<div>1&gt;          c:\program files (x86)\boost\boost_1_46_1\boost\graph\breadth_first_search.hpp(72) : see reference to function template instantiation &#39;void boost::put&lt;boost::vec_adj_list_vertex_id_map&lt;Property,Vertex&gt;,Vertex,unsigned int,boost::default_color_type&gt;(const boost::put_get_helper&lt;Reference,LvaluePropertyMap&gt; &amp;,K,const V &amp;)&#39; being compiled</div>
<div>1&gt;          with</div><div>1&gt;          [</div><div>1&gt;              Property=boost::property&lt;boost::vertex_color_t,boost::default_color_type,boost::property&lt;boost::vertex_rank_t,unsigned int,boost::property&lt;boost::vertex_distance_t,unsigned int,boost::property&lt;boost::vertex_predecessor_t,unsigned int,boost::property&lt;vertex_puzzle_state_t,puzzle_state_t,boost::property&lt;boost::vertex_index_t,unsigned int&gt;&gt;&gt;&gt;&gt;&gt;,</div>
<div>1&gt;              Vertex=unsigned int,</div><div>1&gt;              Reference=unsigned int,</div><div>1&gt;              LvaluePropertyMap=boost::vec_adj_list_vertex_id_map&lt;boost::property&lt;boost::vertex_color_t,boost::default_color_type,boost::property&lt;boost::vertex_rank_t,unsigned int,boost::property&lt;boost::vertex_distance_t,unsigned int,boost::property&lt;boost::vertex_predecessor_t,unsigned int,boost::property&lt;vertex_puzzle_state_t,puzzle_state_t,boost::property&lt;boost::vertex_index_t,unsigned int&gt;&gt;&gt;&gt;&gt;&gt;,unsigned int&gt;,</div>
<div>1&gt;              K=unsigned int,</div><div>1&gt;              V=boost::default_color_type</div><div>1&gt;          ]</div><div>1&gt;          c:\program files (x86)\boost\boost_1_46_1\boost\graph\astar_search.hpp(260) : see reference to function template instantiation &#39;void boost::breadth_first_visit&lt;VertexListGraph,MutableQueue,boost::detail::astar_bfs_visitor&lt;AStarHeuristic,UniformCostVisitor,UpdatableQueue,PredecessorMap,CostMap,DistanceMap,WeightMap,ColorMap,BinaryFunction,BinaryPredicate&gt;,ColorMap&gt;(const IncidenceGraph &amp;,unsigned int,Buffer &amp;,BFSVisitor,ColorMap)&#39; being compiled</div>
<div>1&gt;          with</div><div>1&gt;          [</div><div>1&gt;              VertexListGraph=graph_t,</div><div>1&gt;              AStarHeuristic=manhattan_dist,</div><div>1&gt;              UniformCostVisitor=puzzle_visitor&lt;vertex_t&gt;,</div>
<div>1&gt;              UpdatableQueue=MutableQueue,</div><div>1&gt;              PredecessorMap=boost::vec_adj_list_vertex_property_map&lt;graph_t,graph_t *,unsigned int,unsigned int &amp;,boost::vertex_predecessor_t&gt;,</div>
<div>1&gt;              CostMap=boost::vec_adj_list_vertex_property_map&lt;graph_t,graph_t *,unsigned int,unsigned int &amp;,boost::vertex_rank_t&gt;,</div><div>1&gt;              DistanceMap=boost::vec_adj_list_vertex_property_map&lt;graph_t,graph_t *,unsigned int,unsigned int &amp;,boost::vertex_distance_t&gt;,</div>
<div>1&gt;              WeightMap=boost::adj_list_edge_property_map&lt;boost::undirected_tag,unsigned int,unsigned int &amp;,unsigned int,boost::property&lt;boost::edge_weight_t,unsigned int&gt;,boost::edge_weight_t&gt;,</div>
<div>1&gt;              ColorMap=boost::vec_adj_list_vertex_id_map&lt;boost::property&lt;boost::vertex_color_t,boost::default_color_type,boost::property&lt;boost::vertex_rank_t,unsigned int,boost::property&lt;boost::vertex_distance_t,unsigned int,boost::property&lt;boost::vertex_predecessor_t,unsigned int,boost::property&lt;vertex_puzzle_state_t,puzzle_state_t,boost::property&lt;boost::vertex_index_t,unsigned int&gt;&gt;&gt;&gt;&gt;&gt;,unsigned int&gt;,</div>
<div>1&gt;              BinaryFunction=boost::closed_plus&lt;D&gt;,</div><div>1&gt;              BinaryPredicate=std::less&lt;D&gt;,</div><div>1&gt;              IncidenceGraph=graph_t,</div><div>1&gt;              Buffer=MutableQueue,</div>
<div>1&gt;              BFSVisitor=boost::detail::astar_bfs_visitor&lt;manhattan_dist,puzzle_visitor&lt;vertex_t&gt;,MutableQueue,boost::vec_adj_list_vertex_property_map&lt;graph_t,graph_t *,unsigned int,unsigned int &amp;,boost::vertex_predecessor_t&gt;,boost::vec_adj_list_vertex_property_map&lt;graph_t,graph_t *,unsigned int,unsigned int &amp;,boost::vertex_rank_t&gt;,boost::vec_adj_list_vertex_property_map&lt;graph_t,graph_t *,unsigned int,unsigned int &amp;,boost::vertex_distance_t&gt;,boost::adj_list_edge_property_map&lt;boost::undirected_tag,unsigned int,unsigned int &amp;,unsigned int,boost::property&lt;boost::edge_weight_t,unsigned int&gt;,boost::edge_weight_t&gt;,boost::vec_adj_list_vertex_id_map&lt;boost::property&lt;boost::vertex_color_t,boost::default_color_type,boost::property&lt;boost::vertex_rank_t,unsigned int,boost::property&lt;boost::vertex_distance_t,unsigned int,boost::property&lt;boost::vertex_predecessor_t,unsigned int,boost::property&lt;vertex_puzzle_state_t,puzzle_state_t,boost::property&lt;boost::vertex_index_t,unsigned int&gt;&gt;&gt;&gt;&gt;&gt;,unsigned int&gt;,boost::closed_plus&lt;D&gt;,std::less&lt;D&gt;&gt;</div>
<div>1&gt;          ]</div><div>1&gt;          c:\program files (x86)\boost\boost_1_46_1\boost\graph\astar_search.hpp(373) : see reference to function template instantiation &#39;void boost::astar_search_no_init&lt;VertexListGraph,AStarHeuristic,const Arg,boost::vec_adj_list_vertex_property_map&lt;Graph,GraphPtr,ValueType,Reference,Tag&gt;,boost::vec_adj_list_vertex_property_map&lt;Graph,GraphPtr,ValueType,Reference,boost::vertex_rank_t&gt;,boost::vec_adj_list_vertex_property_map&lt;Graph,GraphPtr,ValueType,Reference,boost::vertex_distance_t&gt;,boost::adj_list_edge_property_map&lt;Directed,Value,Ref,Vertex,Property,boost::edge_weight_t&gt;,boost::vec_adj_list_vertex_id_map&lt;boost::property&lt;boost::vertex_color_t,T,Base&gt;,Vertex&gt;,boost::vec_adj_list_vertex_property_map&lt;Graph,GraphPtr,boost::default_color_type,boost::default_color_type &amp;,boost::vertex_color_t&gt;,const Default,boost::closed_plus&lt;D&gt;,unsigned int,unsigned int&gt;(const VertexListGraph &amp;,unsigned int,AStarHeuristic,AStarVisitor,PredecessorMap,CostMap,DistanceMap,WeightMap,ColorMap,VertexIndexMap,CompareFunction,CombineFunction,CostInf,CostZero)&#39; being compiled</div>
<div>1&gt;          with</div><div>1&gt;          [</div><div>1&gt;              VertexListGraph=graph_t,</div><div>1&gt;              AStarHeuristic=manhattan_dist,</div><div>1&gt;              Arg=const puzzle_visitor&lt;vertex_t&gt;,</div>
<div>1&gt;              Graph=graph_t,</div><div>1&gt;              GraphPtr=graph_t *,</div><div>1&gt;              ValueType=unsigned int,</div><div>1&gt;              Reference=unsigned int &amp;,</div><div>1&gt;              Tag=boost::vertex_predecessor_t,</div>
<div>1&gt;              Directed=boost::undirected_tag,</div><div>1&gt;              Value=unsigned int,</div><div>1&gt;              Ref=unsigned int &amp;,</div><div>1&gt;              Vertex=unsigned int,</div><div>1&gt;              Property=boost::property&lt;boost::edge_weight_t,unsigned int&gt;,</div>
<div>1&gt;              T=boost::default_color_type,</div><div>1&gt;              Base=boost::property&lt;boost::vertex_rank_t,unsigned int,boost::property&lt;boost::vertex_distance_t,unsigned int,boost::property&lt;boost::vertex_predecessor_t,unsigned int,boost::property&lt;vertex_puzzle_state_t,puzzle_state_t,boost::property&lt;boost::vertex_index_t,unsigned int&gt;&gt;&gt;&gt;&gt;,</div>
<div>1&gt;              Default=const std::less&lt;D&gt;,</div><div>1&gt;              AStarVisitor=const puzzle_visitor&lt;vertex_t&gt;,</div><div>1&gt;              PredecessorMap=const boost::vec_adj_list_vertex_property_map&lt;graph_t,graph_t *,unsigned int,unsigned int &amp;,boost::vertex_predecessor_t&gt;,</div>
<div>1&gt;              CostMap=boost::vec_adj_list_vertex_property_map&lt;graph_t,graph_t *,unsigned int,unsigned int &amp;,boost::vertex_rank_t&gt;,</div><div>1&gt;              DistanceMap=boost::vec_adj_list_vertex_property_map&lt;graph_t,graph_t *,unsigned int,unsigned int &amp;,boost::vertex_distance_t&gt;,</div>
<div>1&gt;              WeightMap=boost::adj_list_edge_property_map&lt;boost::undirected_tag,unsigned int,unsigned int &amp;,unsigned int,boost::property&lt;boost::edge_weight_t,unsigned int&gt;,boost::edge_weight_t&gt;,</div>
<div>1&gt;              ColorMap=boost::vec_adj_list_vertex_id_map&lt;boost::property&lt;boost::vertex_color_t,boost::default_color_type,boost::property&lt;boost::vertex_rank_t,unsigned int,boost::property&lt;boost::vertex_distance_t,unsigned int,boost::property&lt;boost::vertex_predecessor_t,unsigned int,boost::property&lt;vertex_puzzle_state_t,puzzle_state_t,boost::property&lt;boost::vertex_index_t,unsigned int&gt;&gt;&gt;&gt;&gt;&gt;,unsigned int&gt;,</div>
<div>1&gt;              VertexIndexMap=boost::vec_adj_list_vertex_property_map&lt;graph_t,graph_t *,boost::default_color_type,boost::default_color_type &amp;,boost::vertex_color_t&gt;,</div><div>1&gt;              CompareFunction=const std::less&lt;D&gt;,</div>
<div>1&gt;              CombineFunction=const boost::closed_plus&lt;D&gt;,</div><div>1&gt;              CostInf=const std::numeric_limits&lt;unsigned int&gt;::_Ty,</div><div>1&gt;              CostZero=const D</div><div>1&gt;          ]</div>
<div>1&gt;          c:\cppprojects\implicit_astar\implicit_astar\implicit_astar_test1.cpp(269) : see reference to function template instantiation &#39;void boost::astar_search_no_init&lt;graph_t,manhattan_dist,RankMap,boost::vertex_rank_t,boost::bgl_named_params&lt;T,Tag,Base&gt;&gt;(const VertexListGraph &amp;,unsigned int,AStarHeuristic,const boost::bgl_named_params&lt;RankMap,boost::vertex_rank_t,boost::bgl_named_params&lt;T,Tag,Base&gt;&gt; &amp;)&#39; being compiled</div>
<div>1&gt;          with</div><div>1&gt;          [</div><div>1&gt;              T=ColorMap,</div><div>1&gt;              Tag=boost::vertex_color_t,</div><div>1&gt;              Base=boost::bgl_named_params&lt;DistanceMap,boost::vertex_distance_t,boost::bgl_named_params&lt;PredMap,boost::vertex_predecessor_t,boost::bgl_named_params&lt;WeightMap,boost::edge_weight_t,boost::bgl_named_params&lt;IndexMap,boost::vertex_index_t,boost::bgl_named_params&lt;puzzle_visitor&lt;vertex_t&gt;,boost::graph_visitor_t,boost::no_property&gt;&gt;&gt;&gt;&gt;,</div>
<div>1&gt;              VertexListGraph=graph_t,</div><div>1&gt;              AStarHeuristic=manhattan_dist</div><div>1&gt;          ]</div><div>========== Build: 0 succeeded, 1 failed, 0 up-to-date, 0 skipped ==========</div>
<div><br></div><br><div class="gmail_quote">On Wed, Jul 20, 2011 at 8:09 PM, Jeremiah Willcock <span dir="ltr">&lt;<a href="mailto:jewillco@osl.iu.edu">jewillco@osl.iu.edu</a>&gt;</span> wrote:<br><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex;">
On Wed, 20 Jul 2011, anilpanicker wrote:<br>
<br>
<blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex">
I&#39;m trying to compile the puzzle 8  given in this link<br>
<br>
<a href="http://www.cs.rpi.edu/~beevek/research/astar_bgl04.pdf" target="_blank">http://www.cs.rpi.edu/~beevek/<u></u>research/astar_bgl04.pdf</a><br>
<br>
using astar_search_no_init()<br>
<br>
but I get this error &quot;error C2106: &#39;=&#39; : left operand must be l-value&quot;<br>
I&#39;m using VS2010. Can someone please help me<br>
</blockquote>
<br>
What is the full error message you get, including the instantiation stack? Which version of Boost are you using?<br><font color="#888888">
<br>
-- Jeremiah Willcock<br>
______________________________<u></u>_________________<br>
Boost-users mailing list<br>
<a href="mailto:Boost-users@lists.boost.org" target="_blank">Boost-users@lists.boost.org</a><br>
<a href="http://lists.boost.org/mailman/listinfo.cgi/boost-users" target="_blank">http://lists.boost.org/<u></u>mailman/listinfo.cgi/boost-<u></u>users</a><br>
</font></blockquote></div><br></div>