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-11 11:44:43

Thanks for your reply,
typedef boost::property<boost::vertex_index_t, unsigned int,
                        boost::property<boost::computable_object_t,
                                        plComputableObject*> >
slVertexProperty;

typedef boost::property<boost::edge_weight_t, slScoreValueType>
slEdgeProperty;

typedef boost::adjacency_list<boost::vecS, boost::listS,
boost::bidirectionalS,
                              slVertexProperty, slEdgeProperty> slGraph;

slGraph graph;

Thanks

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

On Thu, Jun 11, 2009 at 3:41 PM, Andrew Sutton <andrew.n.sutton_at_[hidden]>wrote:

>
>
> so, now i want to implement dijkstra_shortest_path , it is giving errors.
>> Please guide me how i can implement this method.
>>
>
> It's hard to say without a little more context. What is the type of the
> graph?
>
> Andrew Sutton
> andrew.n.sutton_at_[hidden]
>
> _______________________________________________
> Boost-users mailing list
> Boost-users_at_[hidden]
> http://lists.boost.org/mailman/listinfo.cgi/boost-users
>