Re: [Boost-users] How to extending algorithms with visitors

From: Simon Buchan (simon_at_[hidden])
Date: 2005-09-15 18:53:43

Simon Buchan wrote:
> Giulio Veronesi wrote:
> 
>>Hi all,
>>
>>I'm enjoying learning the boost graph library. I'm
>>trying to use the Dijkstra algorithm and try to store
>>the shortest path as explained in the subsection
>>"Extending Algorithms with Visitors" of the section
>>"Quick Tour" of the BGL user guide.
>>
>>When I try to compile my code, I get the following
>>error message:
>>
>>mesh.cpp:38: error: expected constructor, destructor,
>>or type conversion before '<' token
>>mesh.cpp:38: error: expected `;' before '<' token
> 
> --------->8---------------->8----------------->8------
> 
>>template <class PredecessorMap>
>>line 38: record_predecessors<PredecessorMap>
>>make_predecessor_recorder(PredecessorMap p) 
>>{
>>  return record_predecessors<PredecessorMap>(p);
>>}
>>___________________________________ 
>>Yahoo! Mail: gratis 1GB per i messaggi e allegati da 10MB 
>>http://mail.yahoo.it
> 
> You forgot 'struct' or 'class' at the start of line 38 :D.
> I find it hard to be too amused, since I have done exactly
> the same thing quite a lot.
Duh!! ignore last message. I'm stupider than even _I_ thought!
(Must have just been looking at mpl stuff or something?)