utput of the results.
<p>&nbsp;
<pre>
  // vector for storing distance property
  std::vector&lt;int&gt; d(num_vertices(G));

  // get the first vertex
  Vertex s = *(vertices(G).first);
  // invoke variant 2 of Dijkstra's algorithm
  dijkstra_shortest_paths(G, s, distance_map(&amp;d[0]));

  std::cout &lt;&lt; &quot;distances from start vertex:&quot; &lt;&lt; std::endl;
  graph_traits&lt;Graph&gt;::vertex_iterator vi;
  for(vi = vertices(G).first; vi != vertices(G).second; ++vi)
    std::cout &lt;&lt; &quo