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#  06 47 62 89 96
Fix #   02 72 00 26 45
amanyasin@gmail.com




On Thu, Jun 11, 2009 at 3:41 PM, Andrew Sutton <andrew.n.sutton@gmail.com> 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@gmail.com

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