 Graph G(edges, edges + sizeof(edges) / sizeof(E), weights, num_nodes);
</pre>
<p>For the external distance property we will use a <tt>std::vector</tt> for
storage. BGL algorithms treat random access iterators as property maps, so we
can just pass the beginning iterator of the distance vector to Dijkstra's
algorithm. Continuing the above example, the following code shows the creation
of the distance vector, the call to Dijkstra's algorithm (implicitly using the
internal edge weight property), and then the o