I'm trying to grasp the BGL using the user guide and reference manual book by J.Seik et al. Trying the ospf-example (\boost_1_31_0\libs\graph\example) using Borland C++ 5.6.4 for Win32 raise the follwing error: "dijkstra_shortest_paths.hpp": E2285 Could not find a match for 'dijkstra_shortest_paths<VertexListGraph,Param,Tag,Rest>(const adjacency_list<vecS,vecS,directedS,no_property,property<edge_weight_t,int,no _property>,no_property,listS>,unsigned int,unsigned int * const,iterator_property_map<int *,vec_adj_list_vertex_id_map<no_property,unsigned int>,int,int &>,adj_list_edge_property_map<directed_tag,int,const int &,unsigned int,const property<edge_weight_t,int,no_property>,edge_weight_t>,vec_adj_list_vertex_i d_map<no_property,unsigned int>,undefined,const closed_plus<int>,undefined,undefined,const default_dijkstra_visitor)' in function void dijkstra_dispatch2<adjacency_list<vecS,vecS,directedS,no_property,property<e dge_weight_t,int,no_property>,no_property,listS>,const iterator_property_map<int *,vec_adj_list_vertex_id_map<no_property,unsigned int>,int,int &>,adj_list_edge_property_map<directed_tag,int,const int &,unsigned int,const property<edge_weight_t,int,no_property>,edge_weight_t>,vec_adj_list_vertex_i d_map<no_property,unsigned int>,bgl_named_params<unsigned int *,vertex_predecessor_t,no_property> >(const adjacency_list<vecS,vecS,directedS,no_property,property<edge_weight_t,int,no _property>,no_property,listS> &,unsigned int,iterator_property_map<int *,vec_adj_list_vertex_id_map<no_property,unsigned int>,int,int &>,adj_list_edge_property_map<directed_tag,int,const int &,unsigned int,const property<edge_weight_t,int,no_property>,edge_weight_t>,vec_adj_list_vertex_i d_map<no_property,unsigned int>,const bgl_named_params<unsigned int *,vertex_predecessor_t,no_property> &) at line 247 The offending line is: choose_param(get_param(params, graph_visitor), make_dijkstra_visitor(null_visitor()))); Please advise in order to get myself going. Best Regards