Hi,<br>&nbsp; I am missing something regarding the correct calling convention for Dijkstra algorithm. Here is the relevant part of the code:<br><br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; typedef boost::associative_property_map&lt; std::map&lt;Vertex, int&gt; &gt;&nbsp; intmapt;<br>
&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; &nbsp;&nbsp;&nbsp; typedef boost::associative_property_map&lt; std::map&lt;Vertex, Vertex&gt; &gt;&nbsp; nodemapt;<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; dijkstra_visitor&lt;null_visitor&gt; mynullvis;<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; dijkstra_shortest_paths&lt;Graph, dijkstra_visitor&lt;null_visitor&gt;, nodemapt, intmapt, intmapt, nodemapt, std::less&lt;int&gt;,<br>
&nbsp;&nbsp;&nbsp; &nbsp;&nbsp;&nbsp; std::plus&lt;int&gt;, std::numeric_limits&lt;int&gt;, std::numeric_limits&lt;int&gt; &gt; (G, v, predmap, distmap, weightmap, indexmap, std::less&lt;int&gt;(), std::plus&lt;int&gt;(), std::numeric_limits&lt;int&gt;::max(), 0, mynullvis);<br>
<br>I get an error as no matching function call dijkstra_shortest_paths. Appreciate some pointers as what could possibly be wrong.<br><br>Thanks<br>sandeep<br><br>