Re: [Boost-users] Help needed to implement D_shortest_path

Subject: Re: [Boost-users] Help needed to implement D_shortest_path
From: Amanullah Yasin (amanyasin_at_[hidden])
Date: 2009-06-12 04:42:07

Dear Andrew
would you like to guide me in more detail? or any easy way to implement this
method.

Thanks

Amanullah YASIN
Master2 (ECD)
Ecole Polytechnique
Université de Nantes, France.
Mob#  [phone]
Fix #   02 72 00 26 45
amanyasin_at_[hidden]

On Fri, Jun 12, 2009 at 2:03 AM, Andrew Sutton <andrew.n.sutton_at_[hidden]>wrote:

>
> typedef boost::adjacency_list<boost::vecS, boost::listS,
>> boost::bidirectionalS,
>>                               slVertexProperty, slEdgeProperty> slGraph;
>>
>
> The errors look like they're coming from an attempt to reinterpret a
> node-based vertex descriptor (void*) as a vector-based descriptor (int). It
> doesn't look like you're passing the index_map to the first Dijkstra's call.
> That might be causing the problem.
>
> Andrew Sutton
> andrew.n.sutton_at_[hidden]
>
> _______________________________________________
> Boost-users mailing list
> Boost-users_at_[hidden]
> http://lists.boost.org/mailman/listinfo.cgi/boost-users
>