Re: [Boost-users] [BGL] how to call Dijkstra

Hello You don't need to call dijkstra and specify all the templates as most of them have default values, and it's much more convinient to use named parameters: boost::dijkstra_shortest_paths(graph, start_node, boost::predecessor_map(predmap) .distance_map(distmap) .weight_map(weightmap) ); } On Thu, Oct 30, 2008 at 9:00 PM, Sandeep Gupta wrote:

Hi, I am missing something regarding the correct calling convention for Dijkstra algorithm. Here is the relevant part of the code:

typedef boost::associative_property_map< std::map > intmapt; typedef boost::associative_property_map< std::map

...

nodemapt; dijkstra_visitor mynullvis; dijkstra_shortest_paths, nodemapt, intmapt, intmapt, nodemapt, std::less<int>, std::plus<int>, std::numeric_limits<int>, std::numeric_limits<int> > (G, v, predmap, distmap, weightmap, indexmap, std::less<int>(), std::plus<int>(), std::numeric_limits<int>::max(), 0, mynullvis);

I get an error as no matching function call dijkstra_shortest_paths. Appreciate some pointers as what could possibly be wrong.

Thanks sandeep

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