Hello people<br><br>I&#39;m stubbling on a very stupid problem I think, but I can&#39;t find any hint about it.<br><br>I&#39;m using the boost algorithm dijkstra_shortest_path and I simply want to know how to retrieve all the steps the algo goes through for the shortest path found.<br>
To illustrate : I&#39;m glad to know that to go from A to Z, the minimal cost is 26, but I would like also to know that this path goes from A to B then from B to C etc.<br><br>I used the example <a rel="nofollow" href="http://www.boost.org/doc/libs/1_51_0/libs/graph/example/dijkstra-example.cpp%29" target="_blank" class="cLink">http://www.boost.org/doc/libs/1_51 [...] ample.cpp</a><br>
So I ended up with dijkstra_shortest_paths(g, s, &amp;p[0], &amp;d[0], weightmap, indexmap,
 std::less&lt;int&gt;(), closed_plus&lt;int&gt;(), 
(std::numeric_limits&lt;int&gt;::max)(), 0,default_dijkstra_visitor());
(I use Visual)<br>Is the info I need somewhere in the visitor, or something ?<br><br><br>Thanks for any help you can provide,<br><br><br>Sorry for my crappy english<br>V<br><br>