Hi Doug,

thanks for your reply. Actually I think it is an issue with the microsoft VC++ compiler (we are using MS VC++ .net 2003). The example provided with in the documentation didn't compile either using the bgl_named_params. I had to provide the full argument list to get it working but now it runs okay.

Thanks alot for your reply, I should have sent another email saying I got it working.

best regards,

matt-
ps: this is a great library !!

Douglas Gregor <doug.gregor@gmail.com>
Sent by: boost-users-bounces@lists.boost.org

21/12/2005 00:08
Please respond to boost-users

To: boost-users@lists.boost.org
cc: (bcc: Matthieu Ferrant/AWPZV/EMEA/AGFA)
Subject: Re: [Boost-users] compilation problems with the boost graph library and dijkstra_shortest_paths

On Dec 15, 2005, at 7:18 AM, matthieu.ferrant@agfa.com wrote:
> I am having trouble using (actually compiling with) the boost graph
> library. When I add a dijkstra_shortest_paths command (even just as
> in the example of the quick tour), it spits out the following error
> at compile time :
>
>
> Z:\improc\include\boost\graph\dijkstra_shortest_paths.hpp(136):
> error C2664: 'bool std::less<_Ty>::operator ()(const _Ty &,const
> _Ty &) const' : cannot convert parameter 1 from 'const
> boost::detail::adj_list_any_edge_pmap::bind_<Graph,Property,Tag>::valu
> e_type' to 'const D &'
> with
> [
> _Ty=D
> ]
> and
> [
> Graph=Graph,
>
> Property=boost::detail::edge_property_map<Graph,boost::edge_weight_t>:
> :Property,
> Tag=boost::edge_weight_t
> ]

It looks like the type Ty in std::less<_Ty> does not match the type
stored in the property map. What do your call to
dijkstra_shortest_paths() and your adjacency_list<...> type look like?

Doug
_______________________________________________
Boost-users mailing list
Boost-users@lists.boost.org
http://lists.boost.org/mailman/listinfo.cgi/boost-users