title: Boost dijkstra shortest_path - how can you get the shortest path and not just the distance?
body: <p>I have a need to use the Boost library to get the shortest path from one point to another. I've looked over the example code and it is decently easy to follow. However, the example only shows how to get the overall distances. I'm trying to figure out how to iterate over the predecessor map to actually <em>get</em> the shortest path and I can't seem to figure it out. I've read these two questions on the subject:</p>
  
  <p><a href="https://stackoverflow.com/questions/7156880/dijkstra-shortest-path-with-vertexlist-lists-in-boost-graph">Dijkstra Shortest Path with VertexList = ListS in boost graph</a></p>
  
  <p><a href="https://stackoverflow.com/questions/10109862/boost-dijkstra-shortest-path-how-to-get-vertice-index-from-path-iterator">Boost:: Dijkstra Shortest Path, how to get vertice index from path iterator?</a></p>
  
  <p>But in both of the examples provided, the IndexMap typedef doesn't seem to work with the Visual Studio compiler and, frankly, Boost typedefs are a little confusing to me and I'm having some trouble figuring all of this out. Based on the Boost example code here, could anyone tell me how I can just get the path out of it? I would be very thankful.</p>
  
  <p><a href="http://www.boost.org/doc/libs/1_46_1/libs/graph/example/dijkstra-example.cpp" rel="nofollow noreferrer">http://www.boost.org/doc/libs/1_46_1/libs/graph/example/dijkstra-example.cpp</a></p>