/pre>
<p>We are now ready to use the <tt>record_predecessors</tt> in
Dijkstra's algorithm. Luckily, BGL's Dijkstra's algorithm is already
equipped to handle visitors, so we just pass in our new visitor. In
this example we only need to use one visitor, but the BGL is also
equipped to handle the use of multiple visitors in the same algorithm
(see Section <a href="visitor_concepts.html">Visitor Concepts</a>).
<p>&nbsp;
<pre>
  using std::vector;
  using std::cout;
  using std::endl;
  vector&lt;Vertex&gt; p(nu