Hi, I am getting following error when trying to use the johnson_all_pairs_shortest_paths( ) function in boost graph library (BGL). "no matching function for call to johnson_all_pairs_shortest_paths(boost::adjacency_list<boost::setS, boost::vecS, boost::bidirectionalS, boost::property<boost::vertex_name_t, std::string, boost::no_property>, boost::property<boost::edge_weight_t, int, boost::property<boost::edge_weight2_t, int, boost::no_property> >, boost::no_property, boost::listS>&, int[((unsigned int)((int)V))][((unsigned int)((int)V))], boost::bgl_named_params<int*, boost::vertex_distance_t, boost::no_property>) " relevant variable declarations & typedefs are: typedef adjacency_list <setS, vecS, bidirectionalS, property <vertex_name_t, std::string>, \ property <edge_weight_t, int, property< edge_weight2_t, int > > > Graph; ..... // Graph g is constructed ..... int V = num_vertices(g); std::vector < int >d_j(V, (std::numeric_limits < int >::max)()); int D[V][V]; ..... // call Johnson's all pair shortest path algo. johnson_all_pairs_shortest_paths(g, D, distance_map(&d_j[0])); Do let me know if any more info is reqd. I would greatly appreciate any help/suggestions. Thanks and regards, Sangam =====-----=====-----===== Notice: The information contained in this e-mail message and/or attachments to it may contain confidential or privileged information. If you are not the intended recipient, any dissemination, use, review, distribution, printing or copying of the information contained in this e-mail message and/or attachments to it are strictly prohibited. If you have received this communication in error, please notify us by reply e-mail or telephone and immediately and permanently delete the message and any attachments. Thank you